The matching polynomials and spectral radii of uniform supertrees

zbMath1402.05110arXiv1807.01180MaRDI QIDQ1991421

Li Su, Erfang Shan, Hong-Hai Li, Li-ying Kang

Publication date: 30 October 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.01180

zbMATH Keywords

hypergrapheigenvaluematching polynomialadjacency tensorsupertree

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree, Spectra of weighted uniform hypertrees, 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 matching polynomials of hypergraphs and weighted hypergraphs, The trace and Estrada index of uniform hypergraphs with cut vertices, The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge, On a relationship between the characteristic and matching polynomials of a uniform hypertree, The largest spectral radius of uniform hypertrees with a given size of matching, 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, Uniform supertrees with extremal spectral radii, The second largest spectral radii of uniform hypertrees with given size of matching

Cites Work

• Connected hypergraphs with small spectral radius
• The extremal spectral radii of \(k\)-uniform supertrees
• Spectra of uniform hypergraphs
• Some spectral properties of uniform hypergraphs
• Upper bounds for \(H\)- and \(Z\)-spectral radii of uniform hypergraphs
• Spectral radius of uniform hypergraphs and degree sequences
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• Spektren endlicher Grafen
• On the spectral radius of trees with fixed diameter
• Perron-Frobenius theorem for nonnegative tensors
• On the adjacency spectra of hypertrees
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Hypergraph theory. An introduction
• Analytic methods for uniform hypergraphs
• The Laplacian of a uniform hypergraph
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• The maximum spectral radii of uniform supertrees with given degree sequences
• The spectra of uniform hypertrees
• The first two largest spectral radii of uniform supertrees with given diameter
• A general product of tensors with applications
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• On the eigenvalues of trees
• A survey on the spectral theory of nonnegative tensors
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Tensor Analysis
• Ordering of some uniform supertrees with larger spectral radii