The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Abstract
Let G be a connected non-bipartite graph on n vertices with domination number γ n+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 γ.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.