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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Chemistry |
| Online Access: | http://dx.doi.org/10.1155/2021/4272208 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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-9071 |