General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
| Main Author: | Vetrík, Tomáš; Department of Mathematics and Applied Mathematics, University of the Free State, Bloemfontein, South Africa |
|---|---|
| Other Authors: | National Research Foundation of South Africa |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2023
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1735 https://www.ejgta.org/index.php/ejgta/article/view/1735/pdf_258 |
Daftar Isi:
- Among bipartite graphs with given order and matching number/vertex cover number/edge cover number/independence number, among multipartite graphs with given order, and among graphs with given order and chromatic number, we present the graphs having the maximum degree-based index if that index satisfies certain conditions. We show that those conditions are satisfied by the general sum-connectivity index χa for all or some a ≥ 0.