Back to Search
Start Over
On the α-spectral radius of the k-uniform supertrees.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Aug2024, Vol. 16 Issue 6, p1-17. 17p. - Publication Year :
- 2024
-
Abstract
- Let G be a k -uniform hypergraph with vertex set V (G) and edge set E (G). A connected and acyclic hypergraph is called a supertree. For 0 ≤ α < 1 , the α -spectral radius of G is the largest H -eigenvalue of α D (G) + (1 − α) A (G) , where D (G) and A (G) are the diagonal tensor of the degrees and the adjacency tensor of G , respectively. In this paper, we determine the unique supertrees with maximum α -spectral radius among all k -uniform supertrees with m edges and independence number β for ⌈ m (k − 1) + 1 k ⌉ ≤ β ≤ m , among all k -uniform supertrees with given degree sequences, and among all k -uniform supertrees with m edges and matching number μ for 1 ≤ μ ≤ ⌊ m (k − 1) + 1 k ⌋ , respectively. [ABSTRACT FROM AUTHOR]
- Subjects :
- *HYPERGRAPHS
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 16
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 178557933
- Full Text :
- https://doi.org/10.1142/S1793830923500672