Sharp upper bounds on forgotten and SK indices of cactus graph

Sheehalli and Kanabur presented new forms of topological indices known as SK indices which have many applications in chemical graph theory towards QSPR/QSAR. A simple connected graph Γ is called a cactus graph if and only if any two cycles in the graph have no common edge. In this paper, we will exp...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of discrete mathematical sciences & cryptography Vol. ahead-of-print; no. ahead-of-print; pp. 1 - 22
Main Authors:	Alsinai, Ammar, Rehman, Hafiz Mutee ur, Manzoor, Yasir, Cancan, Murat, Taş, Ziyattin, Farahani, Moahmmad Reza
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 01-01-2023
Subjects:	Cactus graph Chemical graph theory Primary 05C31 Topological index
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Sheehalli and Kanabur presented new forms of topological indices known as SK indices which have many applications in chemical graph theory towards QSPR/QSAR. A simple connected graph Γ is called a cactus graph if and only if any two cycles in the graph have no common edge. In this paper, we will explore and determine the sharp upper bounds of cactus graph using different versions of SK indices. We will also characterize the extremal properties for these indices due to many applications in pharmacology and medicinal chemistry.
ISSN:	0972-0529 2169-0065
DOI:	10.1080/09720529.2022.2027605