Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

DOI10.1007/S11464-020-0842-0MaRDI QIDQ777090zbMATH OpenOpenAlexFDO

Authors Zhu Zhu, Yi Wang, Yizheng Fan

Publication date 3 July 2020

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

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

zbMATH Keywords

eigenvectoradjacency tensorhypergraphperturbationleast H-eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hypergraphs (05C65) Solving polynomial systems; resultants (13P15)

Abstract: Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $mathcalA(G)$ be the adjacency tensor of $G$. The least H-eigenvalue of $mathcalA(G)$ refers to the least real eigenvalue of $mathcalA(G)$ associated with a real eigenvector. In this paper we obtain a perturbation result on the least H-eigenvalue of $mathcalA(G)$ when a branch of $G$ attached at one vertex is relocated to another vertex, and characterize the unique hypergraph whose least H-eigenvalue attains the minimum among all hypergraphs in a certain class of hypergraphs which contain a fixed connected hypergraph.

Recommendations

• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
• The trace and Estrada index of uniform hypergraphs with cut vertices
• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• A survey on the spectral theory of nonnegative tensors.
• Connected hypergraphs with small spectral radius
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Hypergraphs and hypermatrices with symmetric spectrum
• Maximizing spectral radii of uniform hypergraphs with few edges
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Perron-Frobenius theorem for nonnegative tensors
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Spectra of uniform hypergraphs
• The \(H\)-spectra of a class of generalized power hypergraphs
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• The extremal spectral radii of k-uniform supertrees
• The largest \(H\)-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs

Cited in

(3)

• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs

This page was built for publication: Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

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