On Least Distance Eigenvalue of Uniform Hypergraphs
نویسندگان
چکیده
منابع مشابه
On the Second Least Distance Eigenvalue of a Graph
Let G be a connected graph on n vertices, and let D(G) be the distance matrix of G. Let ∂1(G) ≥ ∂2(G) ≥ · · · ≥ ∂n(G) denote the eigenvalues of D(G). In this paper, the connected graphs with ∂n−1(G) at least the smallest root of x3 − 3x2 − 11x− 6 = 0 are determined. Additionally, some non-isomorphic distance cospectral graphs are given.
متن کاملOn distance-regular graphs with smallest eigenvalue at least -m
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer m ≥ 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2 ≥ 2.
متن کاملOn the Second Eigenvalue of Hypergraphs
where n = |V |. Let G = (V,E) be a 3-uniform hypergraph; i.e. E is a subset of subsets of V of size 3. We consider the space, L(V ), of real valued functions on V with the usual inner product; let e1, . . . , en be the standard basis for L(V ), where ei takes the value 1 on the i-th vertex of V and 0 elsewhere. It is natural to construct from G a trilinear form, that is a map from τ , mapping t...
متن کاملDomination game on uniform hypergraphs
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph H by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the set of vertices dominated so far. The game is over if all vertices of H are dominated. Dominator aims to finish the game as soon as possible, while Staller aims to delay...
متن کاملDistance-regular Cayley graphs with least eigenvalue -2
We classify the distance-regular Cayley graphs with least eigenvalue −2 and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2018
ISSN: 1027-5487
DOI: 10.11650/tjm/180201