On the adjacency spectra of hypertrees

MaRDI QIDQ1648656zbMATH OpenFDO

Authors Gregory J. Clark, Joshua Cooper

Publication date 27 June 2018

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

Full work available at URL https://arxiv.org/abs/1711.01466, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p48

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

zbMATH Keywords

characteristic polynomialhypergraphmatching polynomialpower graph

Mathematics Subject Classification ID

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

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.

Review text

Summary: We show that \(\lambda\) is an eigenvalue of a \(k\)-uniform hypertree \((k \geq 3)\) 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.

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

Cites work

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

Cited in

(19)

• The matching polynomials and spectral radii of uniform supertrees
• Uniform supertrees with extremal spectral radii
• The characteristic polynomial of the complete 3-uniform hypergraph
• Spectra of weighted uniform hypertrees
• Adjacency spectra of random and complete hypergraphs
• The spectra of uniform hypertrees
• On the spectra of hypertrees
• The Spectra of Infinite Hypertrees
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• Adjacency spectrum of complete 4-uniform hypergraph.
• Spectral moments of hypertrees and their applications
• The matching polynomials of hypergraphs and weighted hypergraphs
• Estrada index and subgraph centrality of hypergraphs via tensors
• On a relationship between the characteristic and matching polynomials of a uniform hypertree
• On the minimum driver node set of k-uniform linear hypertree networks
• The algebraic multiplicity of the spectral radius of a uniform hypertree
• A hypergraph Heilmann-Lieb theorem
• Uniform hypertrees with maximum nullity
• Random matchings in linear hypergraphs

Describes a project that uses

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)