The maximum spectral radii of uniform supertrees with given degree sequences

From MaRDI portal
Publication:2400243

DOI10.1016/j.laa.2017.02.018zbMath1370.05146OpenAlexW2591334693MaRDI QIDQ2400243

Peng Xiao, Li-Gong Wang, Yong Lu

Publication date: 28 August 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.02.018




Related Items (33)

The minimum spectral radius of the r-uniform supertree having two vertices of maximum degreeThe weighted hypergraph with the maximum spectral radiusOn extremal spectral radii of uniform supertrees with given independence numberOn some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraphThe linear unicyclic hypergraph with the second or third largest spectral radiusThe spectral radii of intersecting uniform hypergraphsThe first two largest spectral radii of uniform supertrees with given diameterThe maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameterThe hypertree with the largest spectral radius among all hypertrees with given size and stability numberThe effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edgeThe maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertreesOn the spectral radius of uniform weighted hypergraphThe largest spectral radius of uniform hypertrees with a given size of matchingThe maximum spectral radius of uniform hypergraphs with given number of pendant edgesThe maximum spectral radius ofk-uniform hypergraphs withrpendent verticesSpectral radius of \(r\)-uniform supertrees with perfect matchingsBounds on the spectral radius of general hypergraphs in terms of clique numberSpectral radius and matching number of the unicyclic hypergraphThe effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edgesSharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique numberA bound on the spectral radius of hypergraphs with \(e\) edgesSome properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphsThe matching polynomials and spectral radii of uniform supertreesSigned \(k\)-uniform hypergraphs and tensorsThe smallest spectral radius of bicyclic uniform hypergraphs with a given sizeOn the spectral radius of uniform hypertreesLargest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)Uniform supertrees with extremal spectral radiiThe second largest spectral radii of uniform hypertrees with given size of matchingOn the \(\alpha \)-spectral radius of uniform hypergraphsUniform hypergraphs with the first two smallest spectral radiiOn the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radiiThe (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs



Cites Work


This page was built for publication: The maximum spectral radii of uniform supertrees with given degree sequences