Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Yi-Zheng Fan ; Ying-Ying Tan ; Xi-Xi Peng ; An-Hong Liu
Discussiones Mathematicae Graph Theory, Tome 36 (2016), p. 845-856 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.

Publié le : 2016-01-01
EUDML-ID : urn:eudml:doc:287058 
@article{bwmeta1.element.doi-10_7151_dmgt_1906,
     author = {Yi-Zheng Fan and Ying-Ying Tan and Xi-Xi Peng and An-Hong Liu},
     title = {Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {36},
     year = {2016},
     pages = {845-856},
     zbl = {1350.05111},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1906}
}

Yi-Zheng Fan; Ying-Ying Tan; Xi-Xi Peng; An-Hong Liu. Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 845-856. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1906/