The extremal spectral radii of $$k$$ k -uniform supertrees

Honghai Li (), Jia-Yu Shao () and Liqun Qi ()
Additional contact information
Honghai Li: Jiangxi Normal University
Jia-Yu Shao: Tongji University
Liqun Qi: The Hong Kong Polytechnic University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 3, No 6, 764 pages

Abstract: Abstract In this paper, we study some extremal problems of three kinds of spectral radii of $$k$$ k -uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $$Q$$ Q -spectral radius). We call a connected and acyclic $$k$$ k -uniform hypergraph a supertree. We introduce the operation of “moving edges” for hypergraphs, together with the two special cases of this operation: the edge-releasing operation and the total grafting operation. By studying the perturbation of these kinds of spectral radii of hypergraphs under these operations, we prove that for all these three kinds of spectral radii, the hyperstar $$\mathcal {S}_{n,k}$$ S n , k attains uniquely the maximum spectral radius among all $$k$$ k -uniform supertrees on $$n$$ n vertices. We also determine the unique $$k$$ k -uniform supertree on $$n$$ n vertices with the second largest spectral radius (for these three kinds of spectral radii). We also prove that for all these three kinds of spectral radii, the loose path $$\mathcal {P}_{n,k}$$ P n , k attains uniquely the minimum spectral radius among all $$k$$ k -th power hypertrees of $$n$$ n vertices. Some bounds on the incidence $$Q$$ Q -spectral radius are given. The relation between the incidence $$Q$$ Q -spectral radius and the spectral radius of the matrix product of the incidence matrix and its transpose is discussed.

Keywords: Hypergraph; Spectral radius; Adjacency tensor; Signless Laplacian tensor; Incidence $$Q$$ Q -tensor; Supertree (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9896-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:3:d:10.1007_s10878-015-9896-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9896-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().