Distance (signless) Laplacian spectral radius of uniform hypergraphs.
Saved in:
| Title: | Distance (signless) Laplacian spectral radius of uniform hypergraphs. |
|---|---|
| Authors: | Lin, Hongying1 lhongying0908@126.com, Zhou, Bo1 zhoubo@scnu.edu.cn, Wang, Yanna2 yi.fuxue@163.com |
| Source: | Linear Algebra & its Applications. Sep2017, Vol. 529, p271-293. 23p. |
| Subjects: | Hypergraphs, Graph theory, Fuzzy hypergraphs, Cayley graphs, Bond graphs |
| Abstract: | We determine the unique hypergraphs with minimum distance Laplacian spectral radius among connected k -uniform hypergraphs and k -uniform hypertrees, respectively. We also determine the unique hypergraphs with minimum distance signless Laplacian spectral radius among connected k -uniform hypergraphs, k -uniform hypertrees, and connected k -uniform hypergraphs with given number of pendant edges, respectively. We propose a graft transformation for uniform hypergraphs that increases the distance Laplacian (distance signless Laplacian, respectively) spectral radius, and as applications, we determine the unique power hypertrees with maximum distance Laplacian (distance signless Laplacian, respectively) spectral radius. [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!
