D-Index of Certain Ladder Graphs
For any two distinct vertices , of a connected graph , the -distance , in which the minimum is taken over all paths, and is the length of the path . The -index of is defined as . In this paper, we obtained a formula for -index or Wiener -index , where is the ladder graph, . Also, we obtained the Wiener -index and Wiener index of semi-Ladder graph .
Authors
- Gashaw A. Mohammed Saleh
Institutions
- Salahaddin University-Erbil (IQ)
Publication Details
- Journal
- Journal of Al-Qadisiyah for Computer Science and Mathematics
- Published
- 2024-09-30
- DOI
- https://doi.org/10.29304/jqcsm.2024.16.31668
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00