Further results on the least Q-eigenvalue of a graph with fixed domination number
arXiv:1812.08932
Abstract
In this paper, we proceed on determining the minimum among the connected nonbipartite graphs on vertices and with domination number . Further results obtained are as follows: among all nonbipartite connected graph of order and with domination number , the minimum is completely determined; among all nonbipartite graphs of order , with odd-girth and domination number at least , the minimum is completely determined.
arXiv admin note: substantial text overlap with arXiv:1707.07123