The first two largest spectral radii of uniform supertrees with given diameter

DOI10.1016/j.laa.2017.09.009zbMath1372.05132OpenAlexW2755477840MaRDI QIDQ2412695

Peng Xiao, Li-Gong Wang, Yan-fei Du

Publication date: 27 October 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.09.009

zbMATH Keywords

hypergraphspectral radiusdiametersupertree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (21)

The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree ⋮ The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ The linear unicyclic hypergraph with the second or third largest spectral radius ⋮ The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter ⋮ The hypertree with the largest spectral radius among all hypertrees with given size and stability number ⋮ The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge ⋮ The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees ⋮ The largest spectral radius of uniform hypertrees with a given size of matching ⋮ The maximum spectral radius of uniform hypergraphs with given number of pendant edges ⋮ The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges ⋮ Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number ⋮ Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs ⋮ The matching polynomials and spectral radii of uniform supertrees ⋮ Signed \(k\)-uniform hypergraphs and tensors ⋮ On the spectral radius of uniform hypertrees ⋮ Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices) ⋮ Uniform supertrees with extremal spectral radii ⋮ The second largest spectral radii of uniform hypertrees with given size of matching ⋮ On the \(\alpha \)-spectral radius of uniform hypergraphs ⋮ On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii ⋮ The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs

Cites Work

• Unnamed Item
• Connected hypergraphs with small spectral radius
• The extremal spectral radii of \(k\)-uniform supertrees
• On the principal eigenvectors of uniform hypergraphs
• Maximizing spectral radii of uniform hypergraphs with few edges
• Symmetric nonnegative tensors and copositive tensors
• Spectra of uniform hypergraphs
• Some spectral properties of uniform hypergraphs
• Some upper bounds on the eigenvalues of uniform hypergraphs
• Singular values of nonnegative rectangular tensors
• Ordering uniform supertrees by their spectral radii
• On the spectral radius of trees with fixed diameter
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The maximum spectral radii of uniform supertrees with given degree sequences
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Ordering of some uniform supertrees with larger spectral radii

This page was built for publication: The first two largest spectral radii of uniform supertrees with given diameter