Multiplicative and mining property for stability numbers of graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916741954666496 |
|---|---|
| author | Metsidik, Metrose Xiao, Lixiao |
| author_facet | Metsidik, Metrose Xiao, Lixiao |
| contents | $f$-vertex stability number $vs_f(G)=\min\{|X|: X\subseteq V(G) \enspace \text{and} \enspace f(G-X)\neq f(G)\}$, and $f$-edge stability number is defined similarly by setting $X\subseteq E(G)$. In this paper, for multiplicative and mining invariant $f$, we give some general bounds for $f$-vertex/edge stability numbers of graphs and some results about the relations between the $f$-vertex/edge stability numbers of graphs and their components. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_11782 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multiplicative and mining property for stability numbers of graphs Metsidik, Metrose Xiao, Lixiao Combinatorics $f$-vertex stability number $vs_f(G)=\min\{|X|: X\subseteq V(G) \enspace \text{and} \enspace f(G-X)\neq f(G)\}$, and $f$-edge stability number is defined similarly by setting $X\subseteq E(G)$. In this paper, for multiplicative and mining invariant $f$, we give some general bounds for $f$-vertex/edge stability numbers of graphs and some results about the relations between the $f$-vertex/edge stability numbers of graphs and their components. |
| title | Multiplicative and mining property for stability numbers of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.11782 |