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

preprint2016arXivOpen access

Abstract

In this paper, we prove two results about the signless Laplacian spectral radius q(G)q(G) of a graph GG of order nn with maximum degree ΔΔ. Let Bn=K2+Kn‾B_{n}=K_{2}+\overline{K_{n}} denote a book, i.e., the graph BnB_{n} consists of nn triangles sharing an edge. (1) Let 1<k≤l<Δ<n1< k\leq l< Δ< n and GG be a connected \{Bk+1,K2,l+1B_{k+1},K_{2,l+1}\}-free graph of order nn with maximum degree ΔΔ. Then q(G)≤14[3Δ+k−2l+1+(3Δ+k−2l+1)2+16l(Δ+n−1).\displaystyle q(G)\leq \frac{1}{4}[3Δ+k-2l+1+\sqrt{(3Δ+k-2l+1)^{2}+16l(Δ+n-1)}. with equality holds if and only if GG is a strongly regular graph with parameters (ΔΔ, kk, ll). (2) Let s≥t≥3s\geq t\geq 3, and let GG be a connected Ks,tK_{s,t}-free graph of order nn (n≥s+t)(n\geq s+t). Then q(G)≤n+(s−t+1)1/tn1−1/t+(t−1)(n−1)1−3/t+t−3.q(G)\leq n+(s-t+1)^{1/t}n^{1-1/t}+(t-1)(n-1)^{1-3/t}+t-3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.