On the First Three Extremum Values of Variable Sum Exdeg Index of Trees
For a graph G, its variable sum exdeg index is defined as SEIaG=∑xy∈EGadx+ady, where a is a real number other than 1 and dx is the degree of a vertex x. In this paper, we characterize all trees on n vertices with first three maximum and first three minimum values of the SEIa index. Also, we determin...
Saved in:
Main Authors: | Shu-Bo Chen, Syed Sheraz Asghar, Muhammad Ahsan Binyamin, Zahid Iqbal, Tayyeb Mahmood, Adnan Aslam |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/6491886 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
by: Muhammad Rizwan, et al.
Published: (2021-01-01) -
Extremum Modified First Zagreb Connection Index of n-Vertex Trees with Fixed Number of Pendent Vertices
by: Sadia Noureen, et al.
Published: (2020-01-01) -
On General Sum-Connectivity Index and Number of Segments of Fixed-Order Chemical Trees
by: Muzamil Hanif, et al.
Published: (2025-01-01) -
On the Eccentric Connectivity Polynomial of ℱ-Sum of Connected Graphs
by: Muhammad Imran, et al.
Published: (2020-01-01) -
A Newton-Based Extremum Seeking MPPT Method for Photovoltaic Systems with Stochastic Perturbations
by: Heng Li, et al.
Published: (2014-01-01)