On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

DOI10.1016/J.LAA.2015.04.005zbMATH Open1320.05076arXiv1408.3303OpenAlexW2000751996WikidataQ114152363 ScholiaQ114152363MaRDI QIDQ2348935FDOQ2348935

Authors: Murad-ul-Islam Khan, Yizheng Fan 

Publication date: 16 June 2015

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

Abstract: In order to investigate the non-odd-bipartiteness of even uniform hypergraphs, starting from a simple graph $G$, we construct a generalized power of $G$, denoted by $G^{k,s}$, which is obtained from $G$ by blowing up each vertex into a $k$-set and each edge into a $(k-2s)$-set, where $slek/2$. When $s<k/2$, $G^{k,s}$ is always odd-bipartite. We show that $G^{k,kover2}$ is non-odd-bipartite if and only if $G$ is non-bipartite, and find that $G^{k,kover2}$ has the same adjacency (respectively, signless Laplacian) spectral radius as $G$. So the results involving the adjacency or signless Laplacian spectral radius of a simple graph $G$ hold for $G^{k,kover2}$. In particular, we characterize the unique graph with minimum adjacency or signless Laplacian spectral radius among all non-odd-bipartite hypergraphs $G^{k,kover2}$ of fixed order, and prove that $sqrt2+sqrt5$ is the smallest limit point of the non-odd-bipartite hypergraphs $G^{k,kover2}$. In addition we obtain some results for the spectral radii of the weakly irreducible nonnegative tensors.

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

Recommendations

• The largest \(H\)-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• The \(H\)-spectra of a class of generalized power hypergraphs
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Spectral radii of two kinds of uniform hypergraphs
• Spectral properties of general hypergraphs

zbMATH Keywords

spectral radiusadjacency tensorhypergraphsignless Laplacian tensornon-odd-bipartiteness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Cites Work

• Eigenvalues of a real supersymmetric tensor
• The limit points of eigenvalues of graphs
• On the distribution of the maximum eigenvalues of graphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Connected hypergraphs with small spectral radius
• 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?)
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• On spectral hypergraph theory of the adjacency tensor
• The Ramsey number of generalized loose paths in hypergraphs
• Perron-Frobenius theorem for nonnegative tensors
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Title not available (Why is that?)
• Minimizing the Laplacian spectral radius of trees with given matching number
• Spectral radii of graphs with given chromatic number
• On the largest eigenvalue of a symmetric nonnegative tensor.

Cited In (53)

• The spectral property of hypergraph coverings
• On spectral theory of a k-uniform directed hypergraph
• The algebraic multiplicity of the spectral radius of a uniform hypertree
• All eigenvalues of the power hypergraph and signed subgraphs of a graph
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
• The \(H\)-spectra of a class of generalized power hypergraphs
• The matching polynomials and spectral radii of uniform supertrees
• Spectral radii of two kinds of uniform hypergraphs
• Sharp bounds for the spectral radii of nonnegative tensors
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
• 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
• The largest spectral radius of uniform hypertrees with a given size of matching
• The maximum spectral radii of uniform supertrees with given degree sequences
• A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs
• On the irregularity of uniform hypergraphs
• Spectral radius of uniform hypergraphs and degree sequences
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• Principal eigenvectors and spectral radii of uniform hypergraphs
• A general result on the spectral radii of nonnegative \(k\)-uniform tensors
• Spectral radius and matching number of the unicyclic hypergraph
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• Uniform supertrees with extremal spectral radii
• Equitable partition theorem of tensors and spectrum of generalized power hypergraphs
• Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
• The cyclic index of adjacency tensor of generalized power hypergraphs
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• On extremal spectral radius of blow-up uniform hypergraphs
• Bounds on the spectral radius of uniform hypergraphs
• Some upper bounds on the eigenvalues of uniform hypergraphs
• Relating hypergraph parameters of generalized power graphs
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• The spectrum of a class of uniform hypergraphs
• The trace and Estrada index of uniform hypergraphs with cut vertices
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Ordering of some uniform supertrees with larger spectral radii
• On a generalization of the spectral Mantel's theorem
• Some bounds on the spectral radius of uniform hypergraphs
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• Some properties and applications of odd-colorable \(r\)-hypergraphs
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees
• Upper bounds for signless Laplacian Z-spectral radius of uniform hypergraphs
• Sharp bounds for the signless Laplacian spectral radius of uniform hypergraphs
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs

This page was built for publication: On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

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