Bipartiteness and the least eigenvalue of signless Laplacian of graphs

DOI10.1016/j.laa.2011.11.015zbMath1244.05142MaRDI QIDQ417455

Shaun M. Fallat, Yi-Zheng Fan

Publication date: 14 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.laa.2011.11.015

zbMATH Keywords

graph; signless Laplacian; least eigenvalue; bipartiteness

Mathematics Subject Classification ID

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

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

The inverse sum indeg index of graphs with some given parameters, Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs, The domination number and the least \(Q\)-eigenvalue, The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number, Group invertible block matrices, Extremal graphs with bounded vertex bipartiteness number, Spectral properties of general hypergraphs, Eigenvalue bounds for the signless \(p\)-Laplacian, Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness, On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree, On the sign patterns of the smallest signless Laplacian eigenvector, Balancedness and the least eigenvalue of Laplacian of signed graphs, Graphs with maximum Laplacian and signless Laplacian Estrada index, Graphs with at most one signless Laplacian eigenvalue exceeding three, Some results on resistance distances and resistance matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• On edge singularity and eigenvectors of mixed graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• The signless Laplacian spectral radius of graphs with given degree sequences
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• Signless Laplacian spectral radius and Hamiltonicity
• Bipartite subgraphs and the signless Laplacian matrix
• The Kronecker Product of Graphs
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• On eigenvectors of mixed graphs with exactly one nonsingular cycle
• Towards a spectral theory of graphs based on the signless Laplacian, I
• A characterization of the smallest eigenvalue of a graph
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• On the least eigenvalue of a unicyclic mixed graph
• Towards a spectral theory of graphs based on the signless Laplacian, III
• On graphs with equal algebraic and vertex connectivity