A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The matching polynomials and spectral radii of uniform supertrees
[article]
2018
arXiv
pre-print
Preserved Fulltext
We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results on grafting operations on graphs to supertrees. Using the methods of grafting operations on supertrees and comparing matching polynomials of supertrees, we determine the first d/2+1 largest spectral radii of r-uniform supertrees with size m and diameter d. In addition, the first two smallest spectral radii of supertrees with size m are determined.
arXiv:1807.01180v1
fatcat:elbnrsdttjgrtnr6mogvwo2xsq