A necessary and sufficient eigenvector condition for a connected graph to be bipartite
From MaRDI portal
Publication:3075146
DOI10.13001/1081-3810.1379zbMath1205.05137OpenAlexW2118772790MaRDI QIDQ3075146
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
A conjecture on the spectral radius of graphs, Unimodality of principal eigenvector and its applications, On least eigenvalues and least eigenvectors of real symmetric matrices and graphs, Bounds for the spectral radius of a graph when nodes are removed, Comparing the principal eigenvector of a hypergraph and its shadows, 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, Principal eigenvector of the signless Laplacian matrix, Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs, Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector
