pith. sign in

arxiv: 1309.1632 · v2 · pith:2L7SA65Vnew · submitted 2013-09-06 · 🧮 math.CO

The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number

classification 🧮 math.CO
keywords dominationeigenvaluenumbergammalaplacianleastnon-bipartitesignless
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.