Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Author(s) -
Muhammad Rizwan,
Akhlaq Ahmad Bhatti,
Muhammad Javaid,
Ebenezer Bonyah
Publication year - 2021
Publication title -
journal of chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.436
H-Index - 50
eISSN - 2090-9063
pISSN - 2090-9071
DOI - 10.1155/2021/4272208
Subject(s) - combinatorics , matching (statistics) , graph , vertex (graph theory) , mathematics , bicyclic molecule , discrete mathematics , chemistry , stereochemistry , statistics
A connected graph G V , 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, SEI a for bicyclic graphs with perfect matching for k ≥ 5 and a > 1 .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom