Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices

Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices

For a graph, the <i>SK</i> index is equal to the half of the sum of the degrees of the vertices, the <i>SK</i><sub>1</sub> index is equal to the half of the product of the degrees of the vertices, and the <i>SK</i><sub>2</sub> index is equa...

Full description

Bibliographic Details
Main Authors: Wang Hui, Adnan Aslam, Salma Kanwal, Mahnoor Akram, Tahira Sumbal Shaikh, Xuewu Zuo
Format: Article
Language:English
Published: MDPI AG 2023-04-01
Series:Symmetry
Subjects:
<i>SK</i> indices
graph transformations
girth
pendant vertex
unicyclic graphs
Online Access:https://www.mdpi.com/2073-8994/15/4/871

Internet

https://www.mdpi.com/2073-8994/15/4/871

Similar Items