Further results on the least Q-eigenvalue of a graph with fixed domination number
Abstract
In this paper, we proceed on determining the minimum qmin among the connected nonbipartite graphs on n≥ 5 vertices and with domination number n+13<γ≤ n-12. Further results obtained are as follows: (i) among all nonbipartite connected graph of order n≥ 5 and with domination number n-12, the minimum qmin is completely determined; (ii) among all nonbipartite graphs of order n≥ 5, with odd-girth go≤5 and domination number at least n+13<γ≤ n-22, the minimum qmin is completely determined.
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.