The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree

DOI10.1080/03081087.2020.1819188MaRDI QIDQ5043672zbMATHOpenAlexFDO

Authors Wen-Huan Wang

Publication date 6 October 2022

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2020.1819188

zbMATH Keywords

spectral radiushypergraphmatching polynomialsupertree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Uniform supertrees with extremal spectral radii
• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• Ordering uniform supertrees by their spectral radii
• The first two largest spectral radii of uniform supertrees with given diameter
• The extremal spectral radii of k-uniform supertrees

Cites work

• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• Maximizing spectral radii of uniform hypergraphs with few edges
• On the adjacency spectra of hypertrees
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• On the spectral radius of uniform hypertrees
• Ordering of some uniform supertrees with larger spectral radii
• Spectra of uniform hypergraphs
• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• Spectral radius of uniform hypergraphs
• The extremal spectral radii of \(k\)-uniform supertrees
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The first two largest spectral radii of uniform supertrees with given diameter
• The largest spectral radius of uniform hypertrees with a given size of matching
• The matching polynomials and spectral radii of uniform supertrees
• The maximum spectral radii of uniform supertrees with given degree sequences
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
• The spectra of uniform hypertrees

Cited in

(12)

• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• Uniform supertrees with extremal spectral radii
• The matching polynomials and spectral radii of uniform supertrees
• The extremal spectral radius of the mixed bi-uniform supertrees.
• The maximum spectral radius of the weighted bicyclic hypergraphs
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees
• \(Z\)-spectral radius of the adjacency tensor of uniform supertrees
• On the spectral radius of uniform weighted hypergraph
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• The matching polynomials of hypergraphs and weighted hypergraphs
• The first two largest spectral radii of uniform supertrees with given diameter

This page was built for publication: The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043672)