On Laplacian Energy of r-Uniform Hypergraphs
Open Access
Abstract
The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent studies, the Laplacian matrix of hypergraphs, a generalization of the Laplacian matrix, has been introduced. In this article, based on this definition, we derive bounds depending pair-degree, maximum degree, and the first Zagreb index for the greatest Laplacian eigenvalue and Laplacian energy of r-uniform hypergraphs and r-uniform regular hypergraphs. As a result of these bounds, Nordhaus–Gaddum type bounds are obtained for the Laplacian energy.Keywords
This publication has 24 references indexed in Scilit:
- On Laplacian energy of graphsDiscrete Mathematics, 2014
- Remark on inequalities for the Laplacian spread of graphsCzechoslovak Mathematical Journal, 2014
- The energy of graphs and matricesJournal of Mathematical Analysis and Applications, 2007
- Upper Bounds for the Laplacian Graph EigenvaluesActa Mathematica Sinica, English Series, 2004
- On the Laplacian Eigenvalues and Metric Parameters of HypergraphsLinear and Multilinear Algebra, 2002
- Application of hypergraph theory in chemistryDiscrete Mathematics, 2001
- A simplified Brauer’s theorem on matrix eigenvaluesApplied Mathematics-A Journal of Chinese Universities, 1999
- Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbonsChemical Physics Letters, 1972
- On Complementary GraphsThe American Mathematical Monthly, 1956
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous OperatorsProceedings of the National Academy of Sciences, 1951