Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs

Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs

A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set such that the number of vertices is two times its...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of chemistry 2021-12, Vol.2021, p.1-11
Hauptverfasser: Rizwan, Muhammad, Bhatti, Akhlaq Ahmad, Javaid, Muhammad, Bonyah, Ebenezer
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Equality
Graph matching
Graph theory
Graphs
Molecular structure
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set such that the number of vertices is two times its matching number. In this paper, we investigated maximum and minimum values of variable sum exdeg index, SEIa for bicyclic graphs with perfect matching for k≥5and a>1.
ISSN:2090-9063
2090-9071
DOI:10.1155/2021/4272208