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: | |
|---|---|
| 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!
|
| Summary: | 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 effect on the number of bonds (edges) on the atoms (vertices) carbon (graph). In this article, were found index with respect to new distance (d- index) of regular graph, in addition, finding the relationships between d-index. Also, The relationships and The graph were found between the diameter and the radius for the ordinary distance and between the diameter and the radius for the new distance, and finally, The d-index was found for the join operation of two and nth graphs. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |