相关论文: The Cut Method on Hypergraphs for the Wiener Index
A subgraph is constructed by using a subset of vertices and edges of a given graph. There exist many graph properties that are hereditary for subgraphs. Hence, researchers from different communities have paid a great deal of attention in…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
A new approach is introduced to study QCD amplitudes at high energy and comparatively small momentum transfer. Novel cut diagrams, representing resummation of Feynman diagrams, are used to simplify calculation and to avoid delicate…
A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…
Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different…
A new kind of cut diagram is introduced to sum Feynman diagrams with nonabelian vertices. Unlike the Cutkosky diagrams which compute the discontinuity of single Feynman diagrams, the nonabelian cut diagrams represent a resummation of both…
We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.
The goal of the paper is to apply the general operator theoretic construction known as the Schur complement for computation of the spectrum of certain infinite graphs which can be viewed as finite graphs with the ray attached to them. The…
Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…
Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as…
Our work introduces an innovative approach to graph learning by leveraging Hyperdimensional Computing. Graphs serve as a widely embraced method for conveying information, and their utilization in learning has gained significant attention.…
Given a simple connected graph on $N$ vertices with size $|E|$ and degree sequence $d_{1}\leq d_{2}\leq ...\leq d_{N}$, the aim of this paper is to exhibit new upper and lower bounds for the additive degree-Kirchhoff index in closed forms,…
The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient…
In this article, we present a new method to study relative Cuntz-Krieger algebras for higher-rank graphs. We only work with edges rather than paths of arbitrary degrees. We then use this method to simplify the existing results about…
Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in which each edge connects exactly two vertices, an…
Bridging geometry and topology, curvature is a powerful and expressive invariant. While the utility of curvature has been theoretically and empirically confirmed in the context of manifolds and graphs, its generalization to the emerging…
Using the electromagnetic form factor of a quark as a working example, we describe a subtraction technique to treat infrared sensitive regions in non-inclusive processes.
Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path between two vertices is called the distance. Mathematical…
A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…