Yarong Wu

collaborators

2 papers

math.CO2017

The domination number and the least Q-eigenvalue II

Guanglong Yu

Denote by $L_{g, l}$ the $l o l l i p o p$ $g r a p h$ obtained by attaching a pendant path $P = v_{g} v_{g + 1} \dots v_{g + l}$ ( $l \geq 1$ ) to a cycle $\mathbb{C}=v_{1}v_{2}\cdots v_{g}v_…

math.CO2013

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) ∖ D$ is adjacent to at least a vertex in $D$ , and the domination number $γ (G)$ ( $γ$ ,…