Ordering uniform supertrees by their spectral radii
Xiying YUAN , Xuelian SI , Li ZHANG
Front. Math. China ›› 2017, Vol. 12 ›› Issue (6) : 1393 -1408.
Ordering uniform supertrees by their spectral radii
A supertree is a connected and acyclic hypergraph. For a hypergraph H,the maximal modulus of the eigenvalues of its adjacency tensor is called the spectral radius of H.By applying the operation of moving edges on hypergraphs and the weighted incidence matrix method, we determine the ninth and the tenth k-uniform supertrees with the largest spectral radii among all k-uniform supertrees on nvertices, which extends the known result.
Uniform hypergraph / adjacency tensor / uniform supertree / spectral radius
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
Higher Education Press and Springer-Verlag GmbH Germany
/
| 〈 |
|
〉 |