A necessary and sufficient eigenvector condition for a connected graph to be bipartite

DOI10.13001/1081-3810.1379MaRDI QIDQ3075146zbMATH OpenOpenAlexFDO

Authors Sebastian Cioaba

Publication date 10 February 2011

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/228239, http://www.emis.de/journals/ELA/ela-articles/abstracts/abs_vol20_pp351-353.pdf

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

bipartitegraphindependent setprincipal eigenvector

Mathematics Subject Classification ID

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

Recommendations

• On eigenvalue inequalities of a matrix whose graph is bipartite
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
• scientific article; zbMATH DE number 12941
• scientific article; zbMATH DE number 1286508
• Bipartite graphs with at most six non-zero eigenvalues
• Bipartite graphs with bounded vertex degree and largest eigenvalue of the form \(\sqrt{r} \)
• A sufficient condition for a bipartite graph to have a k‐factor
• On the first eigenvalue of bipartite graphs
• Bounds of eigenvalues of a nontrivial bipartite graph.
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs

Cited in

(15)

• Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• Principal eigenvector of the signless Laplacian matrix
• A conjecture on the spectral radius of graphs
• Unimodality of principal eigenvector and its applications
• scientific article; zbMATH DE number 5631119 (Why is no real title available?)
• Bounds for the spectral radius of a graph when nodes are removed
• Spectral characterization of families of split graphs
• Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
• Some new considerations about double nested graphs
• Bounds for generalized distance spectral radius and the entries of the principal eigenvector
• Comparing the principal eigenvector of a hypergraph and its shadows
• Local properties of the spectral radius and Perron vector in graphs
• Bounds on the \(\mathcal{A}_\alpha \)-spectral radius of uniform hypergraphs with some vertices deleted
• Algebraic bounds on the chromatic number and independent sets of graphs

This page was built for publication: A necessary and sufficient eigenvector condition for a connected graph to be bipartite

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