The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs

DOI10.1016/J.DISC.2020.111987zbMATH Open1443.05119arXiv1902.04233OpenAlexW2914315495MaRDI QIDQ776316FDOQ776316

Authors: Jiang-Chao Wan, Yi Wang, Yizheng Fan 

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $G$ be a connected non-odd-bipartite hypergraph with even uniformity. The least H-eigenvalue of the signless Laplacian tensor of $G$ is simply called the least eigenvalue of $G$ and the corresponding H-eigenvectors are called the first eigenvectors of $G$. In this paper we give some numerical and structural properties about the first eigenvectors of $G$ which contains an odd-bipartite branch, and investigate how the least eigenvalue of $G$ changes when an odd-bipartite branch attached at one vertex is relocated to another vertex. We characterize the hypergraph(s) whose least eigenvalue attains the minimum among a certain class of hypergraphs which contain a fixed non-odd-bipartite connected hypergraph. Finally we present some upper bounds of the least eigenvalue and prove that zero is the least limit point of the least eigenvalues of connected non-odd-bipartite hypergraphs.

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

Recommendations

• H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications

zbMATH Keywords

eigenvectorhypergraphperturbationsignless Laplacian tensorleast H-eigenvalueodd-bipartite

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Eigenvalues of a real supersymmetric tensor
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• The \(H\)-spectra of a class of generalized power hypergraphs
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Title not available (Why is that?)
• Spectra of uniform hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
• Perron-Frobenius theorem for nonnegative tensors
• The least eigenvalue of signless Laplacian of graphs under perturbation
• The largest \(H\)-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite 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
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• Hypergraphs and hypermatrices with symmetric spectrum
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue

Cited In (6)

• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• The largest \(H\)-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

This page was built for publication: The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs

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