Further results on the least Q-eigenvalue of a graph with fixed domination number
Combinatorics
2019-01-03 v2
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.
Cite
@article{arxiv.1812.08932,
title = {Further results on the least Q-eigenvalue of a graph with fixed domination number},
author = {Guanglong Yu and Yarong Wu and Mingqing Zhai},
journal= {arXiv preprint arXiv:1812.08932},
year = {2019}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1707.07123