The matching polynomials and spectral radii of uniform supertrees

zbMATH Open1402.05110arXiv1807.01180MaRDI QIDQ1991421FDOQ1991421

Li Su, Honghai Li, Erfang Shan, Liying Kang

Publication date: 30 October 2018

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

Abstract: We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results on grafting operations on graphs to supertrees. Using the methods of grafting operations on supertrees and comparing matching polynomials of supertrees, we determine the first $lfloorfracd2floor+1$ largest spectral radii of $r$-uniform supertrees with size $m$ and diameter $d$. In addition, the first two smallest spectral radii of supertrees with size $m$ are determined.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

eigenvalueadjacency tensorhypergraphmatching polynomialsupertree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• The second largest spectral radii of uniform hypertrees with given size of matching
• Spectra of weighted uniform hypertrees
• The matching polynomials of hypergraphs and weighted hypergraphs
• The largest spectral radius of uniform hypertrees with a given size of matching
• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• The hypertree with the largest spectral radius among all hypertrees with given size and stability number
• The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree
• Uniform supertrees with extremal spectral radii
• The algebraic multiplicity of the spectral radius of a uniform hypertree
• On a relationship between the characteristic and matching polynomials of a uniform hypertree
• The trace and Estrada index of uniform hypergraphs with cut vertices
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
• 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

This page was built for publication: The matching polynomials and spectral radii of uniform supertrees

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