The signless Laplacian spectral radius of subgraphs of regular graphs

Abstract

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 -regular graph G with n vertices and diameter D. Then 2 - q(H)>1n(D-14). \\2. Let H be a proper subgraph of a k-connected -regular graph G with n vertices, where k≥ 2. Then 2-q(H)>2(k-1)22(n-)(n-+2k-4)+(n+1)(k-1)2. Finally, we compare the two bounds. We obtain that when k>2(n-)(n+-4)n(4D-3)-2+1, the second bound is always better than the first. On the other hand, when k<2(n-)n(4D-3)-2+1, the first bound is always better than the second.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…