Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
نویسندگان
چکیده
منابع مشابه
On the Least Eigenvalue of Graphs with Cut Vertices
Let S be a certain set of graphs. A graph is called a minimizing graph in the set S if its least eigenvalue attains the minimum among all graphs in S . In this paper, we determine the unique minimizing graph in Gn, where Gn denotes the set of connected graphs of order n with cut vertices.
متن کاملThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipar...
متن کاملOn the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑ s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑ s-t-cut with respect to vertices, facets, and adjacency.
متن کاملTwin Vertices in Hypergraphs
Twin vertices in graphs correspond to vertices sharing the same neighborhood. We propose an extension to hypergraphs of the concept of twin vertices. For this we give two characterizations of twin vertices in hypergraphs, a first one in term of clone vertices (the concept of clone has been introduced in [16]) and a second one in term of committees (introduced in [6]). Finally we give an algorit...
متن کاملAdjacency Matrix and Co-occurrence Tensor of General Hypergraphs: Two Well Separated Notions
Adjacency and co-occurence are two well separated notions: even if they are the same for graphs, they start to be two different notions for uniform hypergraphs. After having done the difference between the two notions, this paper contributes in the definition of a co-occurence tensor reflecting the general hypergraph structure. It is a challenging issue that can have many applications if proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Mathematics in China
سال: 2020
ISSN: 1673-3452,1673-3576
DOI: 10.1007/s11464-020-0842-0