Leap Eccentric Connectivity Index of Subdivision Graphs
The second degree of a vertex in a simple graph is defined as the number of its second neighbors. The leap eccentric connectivity index of a graph M, LξcM, is the sum of the product of the second degree and the eccentricity of every vertex in M. In this paper, some lower and upper bounds of LξcSM in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/7880336 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|