The domination number and the least $Q$-eigenvalue

Guanglong Yu, Shu-Guang Guo, Rong Zhang +1

A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma (G)$ ($\gamma$,…