The least Q-eigenvalue with fixed domination number

摘要: Abstract Denote by Lg, l the lollipop graph obtained attaching a pendant path P = v g + 1 ⋯ (l ≥ 1) to cycle C 2 (g ≥ 3). A F , − r p h of order n ≥ is defined be pendent vertices some nonpendant in which each vertex other than attached at most one vertex. ∘ -graph vg with qmin least Q e i u graph. In this paper, we proceed on considering domination number, Q-eigenvalue as well their relation. Further results are follows: (i) about changing number under structural perturbation represented; (ii) among all nonbipartite unicyclic graphs n, both γ and girth ( ≤ ), minimum attains for l; (iii) given contain subgraph, lower bounds (iv) .