On the adjacency spectra of hypertrees

zbMATH Open1391.15082arXiv1711.01466MaRDI QIDQ1648656FDOQ1648656

Authors: Gregory J. Clark, Joshua Cooper 

Publication date: 27 June 2018

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

Abstract: We extend the results of Zhang et al. to show that $lambda$ is an eigenvalue of a $k$-uniform hypertree $(kgeq3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to provide a spectral characterization for power hypertrees. Notably, the situation is quite different from that of ordinary trees, i.e., $2$-uniform trees. We conclude by presenting an example (an $11$ vertex, $3$-uniform non-power hypertree) illustrating these phenomena.

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

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

Recommendations

• The spectra of uniform hypertrees
• Spectra of weighted uniform hypertrees
• On the spectral radius of uniform hypertrees
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• The Spectra of Infinite Hypertrees

zbMATH Keywords

characteristic polynomialhypergraphmatching polynomialpower graph

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65)

Cites Work

• Eigenvalues of a real supersymmetric tensor
• Theory of monomer-dimer systems
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Spectra of uniform hypergraphs
• Some spectral properties of uniform hypergraphs
• Hypergraphs and hypermatrices with symmetric spectrum
• The spectra of uniform hypertrees

Cited In (15)

• Spectra of weighted uniform hypertrees
• The matching polynomials and spectral radii of uniform supertrees
• The matching polynomials of hypergraphs and weighted hypergraphs
• On the minimum driver node set of \(k\)-uniform linear hypertree networks
• Adjacency spectrum of complete 4-uniform hypergraph.
• On the spectra of hypertrees
• Spectral moments of hypertrees and their applications
• Estrada index and subgraph centrality of hypergraphs via tensors
• Uniform supertrees with extremal spectral radii
• Adjacency spectra of random and complete hypergraphs
• 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 spectra of uniform hypertrees
• The characteristic polynomial of the complete 3-uniform hypergraph
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree

Uses Software

• SageMath

This page was built for publication: On the adjacency spectra of hypertrees

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