On the irregularity of uniform hypergraphs.
Saved in:
| Title: | On the irregularity of uniform hypergraphs. |
|---|---|
| Authors: | Lin, Hongying1 (AUTHOR) linhy99@scut.edu.cn, Yu, Gexin2 (AUTHOR) gyu@wm.edu, Zhou, Bo1,3 (AUTHOR) zhoubo@m.scnu.edu.cn |
| Source: | Linear Algebra & its Applications. Dec2023, Vol. 678, p107-124. 18p. |
| Subjects: | Hypergraphs, Measurement |
| Abstract: | For a k -uniform hypergraph G , let β (G) = Δ (G) − ρ (G) , where Δ (G) is the maximum degree of G and ρ (G) is the spectral radius of G via its adjacency tensor. This parameter provides a spectral measure for the irregularity of hypergraphs. We study the β -values of k -uniform hypergraphs with given number of edges. For each of the families of hypertrees, non-power hypertrees, and unicyclic hypergraphs, we determine the first few largest β -values and hypergraphs achieving the values. [ABSTRACT FROM AUTHOR] |
| Copyright of Linear Algebra & its Applications is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
