The least Q-eigenvalue with fixed domination number

Denote by Lg, l the lollipop graph obtained by attaching a pendant path P=vgvg+1⋯vg+l (l ≥ 1) to a cycle C=v1v2⋯vgv1 (g ≥ 3). A Fg,l−graph of order n≥g+1 is defined to be the graph obtained by attaching n−g−l pendent vertices to some of the nonpendant vertices of Lg, l in which each vertex other than vg+l−1 is attached at most one pendant vertex. A Fg,l∘-graph is a Fg,l−graph in which vg is attached with pendant vertex. Denote by qmin the leastQ−eigenvalue of a graph. In this paper, we proceed on considering the domination number, the least Q-eigenvalue of a graph as well as their relation. Further results obtained are as follows: