d-Index of Graphs
The new distance defined on a connected graph G contains of three terms: The ordinary distance between any two vertices in G, both the sum and the product of the two vertices' degrees, as this distance is more useful than the ordinary distance, especially in chemical structures because of its e...
Saved in:
| Main Author: | Asmaa Aziz |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2023-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_181641_0537eb20edc27d2ff44b3b5706b21cf1.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The minimum Wiener index of Halin graphs with characteristic trees of diameter 4
by: Hedi Wang, et al.
Published: (2025-01-01) -
w-Wiener Polynomials for Width Distance of Some Special Graphs
by: Ali Ali, et al.
Published: (2007-12-01) -
Extremal estimates of the Wiener index for weakly connected directed graphs
by: Dmitry Y. Chalyy
Published: (2025-03-01) -
The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs
by: Ali Ali, et al.
Published: (2009-07-01) -
w-Wiener Polynomials for Width Distance of the Cartesian Product of K2 with Special Graphs
by: Ali Ali, et al.
Published: (2008-12-01)