The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number

DOI10.1016/J.DISC.2014.06.021MaRDI QIDQ396729zbMATH OpenOpenAlexFDO

Authors Yizheng Fan, Ying-Ying Tan

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

zbMATH Keywords

domination numberleast eigenvaluesignless Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $gammalefracn+13$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination number $gamma$.

Recommendations

• The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
• On the least signless Laplacian eigenvalues of some graphs
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• scientific article; zbMATH DE number 6612432
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph
• The least eigenvalue of signless Laplacian of graphs under perturbation
• A lower bound on the least signless Laplacian eigenvalue of a graph

Cites work

• scientific article; zbMATH DE number 907925 (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
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Bounds of Laplacian spectrum of graphs based on the domination number
• Bounds on graph eigenvalues. I
• Edge bipartiteness and signless Laplacian spread of graphs
• Eigenvalue bounds for the signless laplacian
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• Minimizing the Laplacian eigenvalues for trees with given domination number
• On edge singularity and eigenvectors of mixed graphs
• On the spectral radius of graphs with a given domination number
• Signless Laplacians of finite graphs
• The least eigenvalue of a graph with a given domination number
• The least eigenvalue of signless Laplacian of graphs under perturbation
• The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
• The smallest eigenvalue of the signless Laplacian
• 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

(13)

• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• The domination number and the least \(Q\)-eigenvalue
• The least \(Q\)-eigenvalue with fixed domination number
• Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
• The least eigenvalue of a graph with a given domination number
• Further results on the least \(Q\)-eigenvalue of a graph with fixed domination number
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• Domination and spectral graph theory
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Least \(Q\)-eigenvalue of a graph
• On the least Q-eigenvalue of a non-bipartite Hamiltonian graph
• The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings

This page was built for publication: The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number

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