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...
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: | |
Online Access: | https://www.mdpi.com/2073-8994/15/4/871 |
Similar Items
-
General Randic index of unicyclic graphs with given number of pendant vertices
by: Tomas Vetrik, et al.
Published: (2022-01-01) -
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
by: Shu-Guang Guo, et al.
Published: (2016-05-01) -
On Unicyclic Graphs with Minimum Graovac–Ghorbani Index
by: Snježana Majstorović Ergotić
Published: (2024-01-01) -
Local antimagic vertex coloring of unicyclic graphs
by: Nuris Hisan Nazula, et al.
Published: (2018-06-01) -
On Critical Unicyclic Graphs with Cutwidth Four
by: Zhenkun Zhang, et al.
Published: (2022-11-01)