Extremal Values of Second Zagreb Index of Unicyclic Graphs Having Maximum Cycle Length: Two New Algorithms
It is well-known that the necessary and sufficient condition for a connected graph to be unicyclic is that its omega invariant, a recently introduced graph invariant useful in combinatorial and topological calculations, is zero. This condition could be stated as the condition that the order and the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/15/2475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|