Generalized toughness and Q-index in a graph
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914089521905664 |
|---|---|
| author | Zhou, Sizhong |
| author_facet | Zhou, Sizhong |
| contents | Let $G$ be a graph. We denote by $c(G)$, $α(G)$ and $q(G)$ the number of components, the independence number and the signless Laplacian spectral radius ($Q$-index for short) of $G$, respectively. The toughness of $G$ is defined by $t(G)=\min\left\{\frac{|S|}{c(G-S)}:S\subseteq V(G), c(G-S)\geq2\right\}$ for $G\neq K_n$ and $t(G)=+\infty$ for $G=K_n$. Chen, Gu and Lin [Generalized toughness and spectral radius of graphs, Discrete Math. 349 (2026) 114776] generalized this notion and defined the $l$-toughness $t_l(G)$ of a graph $G$ as $t_l(G)=\min\left\{\frac{|S|}{c(G-S)}:S\subset V(G), c(G-S)\geq l\right\}$ if $2\leq l\leqα(G)$, and $t_l(G)=+\infty$ if $l>α(G)$. If $t_l(G)\geq t$, then $G$ is said to be $(t,l)$-tough. In this paper, we put forward $Q$-index conditions for a graph to be $(b,l)$-tough and $(\frac{1}{b},l)$-tough, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_10498 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generalized toughness and Q-index in a graph Zhou, Sizhong Combinatorics 05C50, 05C35 Let $G$ be a graph. We denote by $c(G)$, $α(G)$ and $q(G)$ the number of components, the independence number and the signless Laplacian spectral radius ($Q$-index for short) of $G$, respectively. The toughness of $G$ is defined by $t(G)=\min\left\{\frac{|S|}{c(G-S)}:S\subseteq V(G), c(G-S)\geq2\right\}$ for $G\neq K_n$ and $t(G)=+\infty$ for $G=K_n$. Chen, Gu and Lin [Generalized toughness and spectral radius of graphs, Discrete Math. 349 (2026) 114776] generalized this notion and defined the $l$-toughness $t_l(G)$ of a graph $G$ as $t_l(G)=\min\left\{\frac{|S|}{c(G-S)}:S\subset V(G), c(G-S)\geq l\right\}$ if $2\leq l\leqα(G)$, and $t_l(G)=+\infty$ if $l>α(G)$. If $t_l(G)\geq t$, then $G$ is said to be $(t,l)$-tough. In this paper, we put forward $Q$-index conditions for a graph to be $(b,l)$-tough and $(\frac{1}{b},l)$-tough, respectively. |
| title | Generalized toughness and Q-index in a graph |
| topic | Combinatorics 05C50, 05C35 |
| url | https://arxiv.org/abs/2510.10498 |