Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs
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_ | 1866916352647757824 |
|---|---|
| author | Das, Kinkar Chandra Rakshith, B. R. Macek, Wojciech |
| author_facet | Das, Kinkar Chandra Rakshith, B. R. Macek, Wojciech |
| contents | Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature. Ghorbani et al. proposed Inverse symmetric division deg index and is defined as $$ISDD(G)=\sum\limits_{v_iv_j\in E(G)}\,\displaystyle{\frac{d_id_j}{d^2_i+d^2_j}},$$ where $d_i$ is the degree of the vertex $v_i$ in $G$. In this paper, we obtain some lower and upper bounds on the inverse symmetric division deg index $(ISDD)$ of graphs in terms of various graph parameters, with identifying extremal graphs. Moreover, we present two relations between the Inverse symmetric division deg index and the various topological indices of graphs. Finally, we give concluding remarks with future work. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05424 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs Das, Kinkar Chandra Rakshith, B. R. Macek, Wojciech Combinatorics O5C07, 05C09, 05C35 Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature. Ghorbani et al. proposed Inverse symmetric division deg index and is defined as $$ISDD(G)=\sum\limits_{v_iv_j\in E(G)}\,\displaystyle{\frac{d_id_j}{d^2_i+d^2_j}},$$ where $d_i$ is the degree of the vertex $v_i$ in $G$. In this paper, we obtain some lower and upper bounds on the inverse symmetric division deg index $(ISDD)$ of graphs in terms of various graph parameters, with identifying extremal graphs. Moreover, we present two relations between the Inverse symmetric division deg index and the various topological indices of graphs. Finally, we give concluding remarks with future work. |
| title | Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs |
| topic | Combinatorics O5C07, 05C09, 05C35 |
| url | https://arxiv.org/abs/2408.05424 |