Independent Bondage Number in Graphs under Girth Constraints
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918159811870720 |
|---|---|
| author | Gamlath, E. G. K. M. Pham, Andrew Wei, Bing |
| author_facet | Gamlath, E. G. K. M. Pham, Andrew Wei, Bing |
| contents | Given a finite, simple graph $G$, the independent bondage number of $G$ is the minimum size of an edge set such that its deletion results in a graph with strictly larger independent domination number than that of $G$. While the bondage number of graphs under girth constraints has been studied, very few results have yet been established for the independent bondage number. In this study, we establish upper bounds on the independent bondage number of planar graphs under given girth constraints, extending results on the bondage number by Fischermann, Rautenbach, and Volkmann and on the structures of planar graphs by Borodin and Ivanova. In particular, we identify additional structures and establish bounds on the independent bondage number for planar graphs with $δ(G) \geq 2$ and $g(G)\geq 5$, $δ(G)\geq 3$ and $g(G)\geq 4$, and $δ(G) \geq 2$ and $g(G)\geq 10$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01687 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Independent Bondage Number in Graphs under Girth Constraints Gamlath, E. G. K. M. Pham, Andrew Wei, Bing Combinatorics Given a finite, simple graph $G$, the independent bondage number of $G$ is the minimum size of an edge set such that its deletion results in a graph with strictly larger independent domination number than that of $G$. While the bondage number of graphs under girth constraints has been studied, very few results have yet been established for the independent bondage number. In this study, we establish upper bounds on the independent bondage number of planar graphs under given girth constraints, extending results on the bondage number by Fischermann, Rautenbach, and Volkmann and on the structures of planar graphs by Borodin and Ivanova. In particular, we identify additional structures and establish bounds on the independent bondage number for planar graphs with $δ(G) \geq 2$ and $g(G)\geq 5$, $δ(G)\geq 3$ and $g(G)\geq 4$, and $δ(G) \geq 2$ and $g(G)\geq 10$. |
| title | Independent Bondage Number in Graphs under Girth Constraints |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.01687 |