The domination number and the least \(Q\)-eigenvalue
From MaRDI portal
Publication:278336
DOI10.1016/j.amc.2014.06.076zbMath1335.05117arXiv1310.4717OpenAlexW2963470386MaRDI QIDQ278336
Yarong Wu, Shu-Guang Guo, Rong Zhang, Guanglong Yu
Publication date: 2 May 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.4717
Related Items (8)
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 ⋮ Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs ⋮ Further results on the least Q-eigenvalue of a graph with fixed domination number ⋮ Domination and Spectral Graph Theory
Cites Work
- Unnamed Item
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Impulsive cluster anticonsensus of discrete multiagent linear dynamic systems
- The smallest eigenvalue of the signless Laplacian
- Graph spectra in computer science
- On domination and independent domination numbers of a graph
- Signless Laplacians of finite 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.
- Independent domination in graphs: A survey and recent results
- Cluster anticonsensus of multiagent systems based on the \(Q\)-theory
- The least eigenvalue of signless Laplacian of graphs under perturbation
- 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
- On the least signless Laplacian eigenvalues of some graphs
This page was built for publication: The domination number and the least \(Q\)-eigenvalue
