Extremal values on the Kirchhoff index of the line graph of trees
The computation of resistance distance and the Kirchhoff index is a classical problem that has been extensively investigated by numerous mathematicians, physicists, and scientists. Consider a simple connected graph G with vertex set V(G) and edge set E(G). If we replace each edge of G with a resisto...
Saved in:
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Elsevier
2025-01-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410824001524 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Extremal Values of the <i>N<sub>k</sub></i>-Degree Distance Index in Trees
by: Zia Ullah Khan, et al.
Published: (2025-07-01) -
EXTREMAL VALUES ON THE MODIFIED SOMBOR INDEX OF TREES AND UNICYCLIC GRAPHS
by: Raghavendra H Kashyap, et al.
Published: (2024-07-01) -
Graphs with odd and even distances between non-cut vertices
by: Kateryna Antoshyna, et al.
Published: (2024-12-01) -
Comparison of phylogenetic trees defined on different but mutually overlapping sets of taxa: A review
by: Wanlin Li, et al.
Published: (2024-08-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01)