Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

The signless Laplacian spectral radius of subgraphs of regular graphs (1610.08855v1)

Published 27 Oct 2016 in math.CO

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 $\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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.