On the Maximum Symmetric Division Deg Index of k-Cyclic Graphs
Let G be a graph. Denote by du, the degree of a vertex u of G and represent by vw, the edge of G with the end-vertices v and w. The sum of the quantities du2+dv2du−1dv−1 over all edges uv of G is known as the symmetric division deg (SDD) index of G. A connected graph with n vertices and n−1+k edges...
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/7783128 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|