On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth
Let G be a graph having the set of edges EG. Represent by dGu the degree of a vertex u of G. The Sombor (SO) index of G is defined as SOG=∑uv∈EGdGu2+dGv2. The length of a shortest cycle in a graph G is known as the girth of G. A connected graph with the same order and size is usually referred to as...
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/8202681 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!