arXiv Analytics

Sign in

arXiv:1610.08855 [math.CO]AbstractReferencesReviewsResources

The signless Laplacian spectral radius of subgraphs of regular graphs

Qi Kong, Ligong Wang

Published 2016-10-27Version 1

Let $q(H)$ be the signless Laplacian spectral radius of a graph $H$. In this paper, we prove that \\1. Let $H$ be a proper subgraph of a $\Delta$-regular graph $G$ with $n$ vertices and diameter $D$. Then $$2\Delta - q(H)>\frac{1}{n(D-\frac{1}{4})}.$$ \\2. Let $H$ be a proper subgraph of a $k$-connected $\Delta$-regular graph $G$ with $n$ vertices, where $k\geq 2$. Then $$2\Delta-q(H)>\frac{2(k-1)^{2}}{2(n-\Delta)(n-\Delta+2k-4)+(n+1)(k-1)^{2}}.$$ Finally, we compare the two bounds. We obtain that when $k>2\sqrt{\frac{(n-\Delta)(n+\Delta-4)}{n(4D-3)-2}}+1$, the second bound is always better than the first. On the other hand, when $k<\frac{2(n-\Delta)}{\sqrt{n(4D-3)-2}}+1$, the first bound is always better than the second.

Comments: 9 pages, 2 figures, 1 table
Categories: math.CO
Subjects: 05C50, 15A18
Related articles: Most relevant | Search more
arXiv:math/0407274 [math.CO] (Published 2004-07-15, updated 2005-08-12)
On the extreme eigenvalues of regular graphs
arXiv:0909.3910 [math.CO] (Published 2009-09-22)
Note on the energy of regular graphs
arXiv:1602.05922 [math.CO] (Published 2016-02-18)
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs