On extremal graphs with respect to the ABS index
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918265261916160 |
|---|---|
| author | Shetty, Swathi Rakshith, B. R. N. V, Sayinath Udupa |
| author_facet | Shetty, Swathi Rakshith, B. R. N. V, Sayinath Udupa |
| contents | Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected graphs with n vertices and p cut-vertices; (ii) connected graphs of order n with vertex k-partiteness; and (iii) connected bipartite graphs of order n with a fixed vertex connectivity κ. In this paper, we provide complete solutions to all of these problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23199 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On extremal graphs with respect to the ABS index Shetty, Swathi Rakshith, B. R. N. V, Sayinath Udupa Combinatorics 05C50 Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected graphs with n vertices and p cut-vertices; (ii) connected graphs of order n with vertex k-partiteness; and (iii) connected bipartite graphs of order n with a fixed vertex connectivity κ. In this paper, we provide complete solutions to all of these problems. |
| title | On extremal graphs with respect to the ABS index |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2512.23199 |