Uniform hypertrees with maximum nullity

DOI10.1016/J.LAA.2025.10.016MaRDI QIDQ6894390zbMATH OpenFDO

Authors Ya-nan Zheng

Publication date 25 November 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.10.016

zbMATH Keywords

adjacency tensormaximum nullityuniform hypertree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A combinatorial method for computing characteristic polynomials of starlike hypergraphs
• A Harary-Sachs theorem for hypergraphs
• Eigenvalues of a real supersymmetric tensor
• Geometric vs algebraic nullity for hyperpaths
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• Multiplicities of tensor eigenvalues
• Nullity of graphs -- a survey and some new results
• On a relationship between the characteristic and matching polynomials of a uniform hypertree
• On the adjacency spectra of hypertrees
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Spectra of power hypergraphs and signed graphs via parity-closed walks
• Spectra of uniform hypergraphs
• The algebraic multiplicity of the spectral radius of a uniform hypertree
• The characteristic polynomial of the complete 3-uniform hypergraph
• The extremal spectral radii of k-uniform supertrees
• The matching polynomials and spectral radii of uniform supertrees
• Using Algebraic Geometry

This page was built for publication: Uniform hypertrees with maximum nullity

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