arXiv Analytics

Sign in

arXiv:1612.03514 [math.CO]AbstractReferencesReviewsResources

Upper bounds on the Q-spectral radius of book-free and/or $K_{s,t}$-free graphs

Qi Kong, Ligong Wang

Published 2016-12-12Version 1

In this paper, we prove two results about the signless Laplacian spectral radius $q(G)$ of a graph $G$ of order $n$ with maximum degree $\Delta$. Let $B_{n}=K_{2}+\overline{K_{n}}$ denote a book, i.e., the graph $B_{n}$ consists of $n$ triangles sharing an edge. (1) Let $1< k\leq l< \Delta < n$ and $G$ be a connected \{$B_{k+1},K_{2,l+1}$\}-free graph of order $n$ with maximum degree $\Delta$. Then $$\displaystyle q(G)\leq \frac{1}{4}[3\Delta+k-2l+1+\sqrt{(3\Delta+k-2l+1)^{2}+16l(\Delta+n-1)}.$$ with equality holds if and only if $G$ is a strongly regular graph with parameters ($\Delta$, $k$, $l$). (2) Let $s\geq t\geq 3$, and let $G$ be a connected $K_{s,t}$-free graph of order $n$ $(n\geq s+t)$. Then $$q(G)\leq n+(s-t+1)^{1/t}n^{1-1/t}+(t-1)(n-1)^{1-3/t}+t-3.$$

Related articles: Most relevant | Search more
arXiv:1609.08730 [math.CO] (Published 2016-09-28)
Spanning trails with maximum degree at most 4 in $2K_2$-free graphs
arXiv:1706.09029 [math.CO] (Published 2017-06-27)
Hamiltonian cycles in 3-tough $2K_2$-free graphs
arXiv:1312.6213 [math.CO] (Published 2013-12-21, updated 2014-11-15)
Subdivisions of a large clique in $C_6$-free graphs