Bipartiteness and the least eigenvalue of signless Laplacian of graphs
DOI10.1016/J.LAA.2011.11.015zbMATH Open1244.05142OpenAlexW2087638833MaRDI QIDQ417455FDOQ417455
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
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
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)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacian spectral radius and Hamiltonicity
- Title not available (Why is that?)
- Combinatorial matrix theory
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- The Kronecker Product of Graphs
- 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
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Title not available (Why is that?)
- On eigenvectors of mixed graphs with exactly one nonsingular cycle
- Laplace eigenvalues of graphs---a survey
- The signless Laplacian spectral radius of graphs with given degree sequences
- On graphs with equal algebraic and vertex connectivity
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- On the least eigenvalue of a unicyclic mixed graph
- On edge singularity and eigenvectors of mixed graphs
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- Bipartite subgraphs and the signless Laplacian matrix
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
Cited In (38)
- Extremal results and bounds for atom-bond sum-connectivity index
- Weighted microscopic image reconstruction
- Weighted microscopic image reconstruction
- Eigenvalue bounds for the signless \(p\)-Laplacian
- New bounds for the signless Laplacian spread
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- Extremal bipartite graphs with given parameters on the resistance-Harary index
- The domination number and the least \(Q\)-eigenvalue
- The least \(Q\)-eigenvalue with fixed domination number
- Title not available (Why is that?)
- On maximal energy of line graphs with given parameters
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
- Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs
- 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
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Graphs with at most one signless Laplacian eigenvalue exceeding three
- Extremal graphs with bounded vertex bipartiteness number
- Some results on resistance distances and resistance matrices
- Further results on monotonic graph invariants and bipartiteness number
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- Signed spectral Turań-type theorems
- Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
- Spectra of signed graphs
- The inverse sum indeg index of graphs with some given parameters
- The \(A_\alpha\)-spread of a graph
- Further results on the least Q-eigenvalue of a graph with fixed domination number
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- Spectral properties of general hypergraphs
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
- A characterization of the smallest eigenvalue of a graph
- On the sign patterns of the smallest signless Laplacian eigenvector
- Group invertible block matrices
- Residual closeness of graphs with given parameters
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)