Premium
Extremal k ‐uniform hypertrees on incidence energy
Author(s) -
Zhu Qiangyuan
Publication year - 2021
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.26592
Subject(s) - hypergraph , incidence matrix , combinatorics , incidence (geometry) , subdivision , energy (signal processing) , mathematics , physics , graph , matrix (chemical analysis) , laplacian matrix , discrete mathematics , chemistry , quantum mechanics , geometry , archaeology , chromatography , node (physics) , history
Abstract For a k ‐uniform hypergraph H = ( V ( H ), E ( H )) , let B ( H ) be its incidence matrix, Q ( H ) = B ( H ) B ( H ) T be its signless Laplacian matrix. Let S ( H ) be the subdivision graph of H and A S be its adjacent matrix. For a matrix M , its energy E ( M ) is the sum of its singular values. The incidence energy BE ( H ) of H is the energy of B ( H ) . In this article, we obtain some transformations on incidence energy, as their applications, the lower and upper bounds on BE ( H ) for hypertrees are obtained, at the same time, their corresponding extremal hypergraphs are characterized.