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 triples of vectors in L(V ) to R, namely τ n ∑
منابع مشابه
The Spectra of Infinite Hypertrees
We develop a model of regular, infinite hypertrees, to mimic for hypergraphs what infinite trees do for graphs. We then examine two notions of spectra or “first eigenvalue” for the infinite tree, obtaining a precise value for the first notion and obtaining some estimates for the second. The results indicate agreement of the first eigenvalue of the infinite hypertree with the “second eigenvalue”...
متن کاملAnalysis of Natural Frequencies for a Laminated Composite Plate with Piezoelectric Patches using the First and Second Eigenvalue Derivatives
In this paper, the first and second order approximations of Taylor expansion are used for calculating the change of each natural frequency by modifying an arbitrary parameter of a system with a known amount and based on this approximation, the inverse eigenvalue problem is transformed to a solvable algebraic equation. The finite element formulation, based on the classical laminated plate theory...
متن کاملEigenvalues of non-regular linear quasirandom hypergraphs
Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to coregular k-uniform hypergraphs with loops. However, for k ≥ 3 no k-uniform hypergraph is coregular. In this paper we remove the coregular requirement. Consequently, the characterization can be a...
متن کاملThe clique and coclique numbers’ bounds based on the H-eigenvalues of uniform hypergraphs
In this paper, some inequality relations between the Laplacian/signless Laplacian H-eigenvalues and the clique/coclique numbers of uniform hypergraphs are presented. For a connected uniform hypergraph, some tight lower bounds on the largest Laplacian H+-eigenvalue and signless Laplacian H-eigenvalue related to the clique/coclique numbers are given. And some upper and lower bounds on the clique/...
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملEvolution of the first eigenvalue of buckling problem on Riemannian manifold under Ricci flow
Among the eigenvalue problems of the Laplacian, the biharmonic operator eigenvalue problems are interesting projects because these problems root in physics and geometric analysis. The buckling problem is one of the most important problems in physics, and many studies have been done by the researchers about the solution and the estimate of its eigenvalue. In this paper, first, we obtain the evol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 15 شماره
صفحات -
تاریخ انتشار 1995