Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees

DOI10.1007/s11464-017-0678-4zbMath1391.05166OpenAlexW2781021657MaRDI QIDQ722442

Lei Zhang, An Chang, Yuan Hou

Publication date: 23 July 2018

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-017-0678-4

zbMATH Keywords

spectral radiusadjacency tensorhypertreelargest \(H\)-eigenvalue

Mathematics Subject Classification ID

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

Related Items (3)

Graph partitioning: an updated survey ⋮ Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number ⋮ The matching polynomials and spectral radii of uniform supertrees

Cites Work

• Unnamed Item
• The extremal spectral radii of \(k\)-uniform supertrees
• Spectra of uniform hypergraphs
• Perron-Frobenius theorem for nonnegative tensors
• Minimax relations for the partial q-colorings of a graph
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Hypergraph theory. An introduction
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• A survey on the spectral theory of nonnegative tensors
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
• Dually Chordal Graphs

This page was built for publication: Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees