On the edge-Wiener index of the disjunctive product of simple graphs
The edge-Wiener index of a simple connected graph \(G\) is defined as the sum of distances between all pairs of edges of \(G\) where the distance between two edges in \(G\) is the distance between the corresponding vertices in the line graph of \(G\). In this paper, we study the edge-Wiener index un...
Saved in:
| Date: | 2020 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2020
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/242 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| Summary: | The edge-Wiener index of a simple connected graph \(G\) is defined as the sum of distances between all pairs of edges of \(G\) where the distance between two edges in \(G\) is the distance between the corresponding vertices in the line graph of \(G\). In this paper, we study the edge-Wiener index under the disjunctive product of graphs and apply our results to compute the edge-Wiener index for the disjunctive product of paths and cycles. |
|---|