2000 character limit reached
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Published 6 Sep 2013 in math.CO | (1309.1632v2)
Abstract: 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
