Bipartiteness and the least eigenvalue of signless Laplacian of graphs

DOI10.1016/J.LAA.2011.11.015MaRDI QIDQ417455zbMATHOpenAlexFDO

Authors Yizheng Fan, Shaun M. Fallat

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

graphleast eigenvaluesignless Laplacianbipartiteness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Edge bipartiteness and signless Laplacian spread of graphs

Cites work

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

Cited in

(41)

• Residual closeness of graphs with given parameters
• On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph
• On the non-backtracking spectral radius of graphs
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• Balancedness and the least eigenvalue of Laplacian of signed graphs
• Weighted microscopic image reconstruction
• Bounds for the extremal eigenvalues of gain Laplacian matrices
• Graphs with at most one signless Laplacian eigenvalue exceeding three
• The domination number and the least \(Q\)-eigenvalue
• Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
• Bipartite subgraphs and the signless Laplacian matrix
• Extremal graphs with bounded vertex bipartiteness number
• The \(A_\alpha\)-spread of a graph
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Signed spectral Turań-type theorems
• Weighted microscopic image reconstruction
• Spectra of signed graphs
• A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
• The inverse sum indeg index of graphs with some given parameters
• Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs
• Spectral properties of general hypergraphs
• Edge bipartiteness and signless Laplacian spread of graphs
• A characterization of the smallest eigenvalue of a graph
• On the sign patterns of the smallest signless Laplacian eigenvector
• Some results on resistance distances and resistance matrices
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• Extremal bipartite graphs with given parameters on the resistance-Harary index
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• Further results on monotonic graph invariants and bipartiteness number
• Combinatorial algorithms for minimizing the maximum Laplacian and signless Laplacian eigenvalues of weighted graphs
• On maximal energy of line graphs with given parameters
• New bounds for the signless Laplacian spread
• Group invertible block matrices
• On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
• The least \(Q\)-eigenvalue with fixed domination number
• Further results on the least \(Q\)-eigenvalue of a graph with fixed domination number
• Eigenvalue bounds for the signless \(p\)-Laplacian
• Extremal results and bounds for atom-bond sum-connectivity index
• Graphs with maximum Laplacian and signless Laplacian Estrada index

This page was built for publication: Bipartiteness and the least eigenvalue of signless Laplacian of graphs

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