arXiv:1309.1632 Abstract | arXiv Analytics

arXiv:1309.1632 [math.CO]Abstract References Reviews Resources

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

Published 2013-09-06, updated 2014-01-10Version 2

Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $\gamma \le \frac{n+1}{3}$. 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$.

Comments: arXiv admin note: text overlap with arXiv:1310.8533

Categories: math.CO

Subjects: 05C50

Keywords: domination number, signless laplacian, eigenvalue, connected non-bipartite graph

Related articles: Most relevant | Search more

arXiv:1310.4717 [math.CO] (Published 2013-10-17)

The domination number and the least $Q$-eigenvalue

Guanglong Yu, Shu-Guang Guo, Rong Zhang, Yarong Wu

arXiv:2103.15288 [math.CO] (Published 2021-03-29)

Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number

Chang Liu, Jianping Li

arXiv:1410.4334 [math.CO] (Published 2014-10-16)