The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
From MaRDI portal
Publication:396729
DOI10.1016/j.disc.2014.06.021zbMath1298.05202arXiv1309.1632OpenAlexW1991134209MaRDI QIDQ396729
Publication date: 14 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1632
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue ⋮ Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph ⋮ The least \(Q\)-eigenvalue with fixed domination number ⋮ On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree ⋮ Further results on the least Q-eigenvalue of a graph with fixed domination number ⋮ Domination and Spectral Graph Theory
Cites Work
- Unnamed Item
- Unnamed Item
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- The smallest eigenvalue of the signless Laplacian
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Minimizing the Laplacian eigenvalues for trees with given domination number
- Signless Laplacians of finite graphs
- 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.
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- The least eigenvalue of a graph with a given domination number
- The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- The least eigenvalue of signless Laplacian of graphs under perturbation
- On the spectral radius of graphs with a given domination number
- Edge bipartiteness and signless Laplacian spread of graphs
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- A characterization of the smallest eigenvalue of a graph
- Towards a spectral theory of graphs based on the signless Laplacian, III
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
This page was built for publication: The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number