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...
Gespeichert in:
| Datum: | 2020 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2020
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/242 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| _version_ | 1856543305643327488 |
|---|---|
| author | Azari, M. Iranmanesh, A. |
| author_facet | Azari, M. Iranmanesh, A. |
| author_sort | Azari, M. |
| baseUrl_str | |
| collection | OJS |
| datestamp_date | 2021-01-03T16:20:52Z |
| description | 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. |
| first_indexed | 2025-12-02T15:26:25Z |
| format | Article |
| id | admjournalluguniveduua-article-242 |
| institution | Algebra and Discrete Mathematics |
| language | English |
| last_indexed | 2025-12-02T15:26:25Z |
| publishDate | 2020 |
| publisher | Lugansk National Taras Shevchenko University |
| record_format | ojs |
| spelling | admjournalluguniveduua-article-2422021-01-03T16:20:52Z On the edge-Wiener index of the disjunctive product of simple graphs Azari, M. Iranmanesh, A. distance in graphs, edge-Wiener index, disjunctive product of graphs 05C76, 05C12, 05C38 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. Lugansk National Taras Shevchenko University 2020-12-30 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/242 10.12958/adm242 Algebra and Discrete Mathematics; Vol 30, No 1 (2020) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/242/pdf Copyright (c) 2020 Algebra and Discrete Mathematics |
| spellingShingle | distance in graphs edge-Wiener index disjunctive product of graphs 05C76 05C12 05C38 Azari, M. Iranmanesh, A. On the edge-Wiener index of the disjunctive product of simple graphs |
| title | On the edge-Wiener index of the disjunctive product of simple graphs |
| title_full | On the edge-Wiener index of the disjunctive product of simple graphs |
| title_fullStr | On the edge-Wiener index of the disjunctive product of simple graphs |
| title_full_unstemmed | On the edge-Wiener index of the disjunctive product of simple graphs |
| title_short | On the edge-Wiener index of the disjunctive product of simple graphs |
| title_sort | on the edge-wiener index of the disjunctive product of simple graphs |
| topic | distance in graphs edge-Wiener index disjunctive product of graphs 05C76 05C12 05C38 |
| topic_facet | distance in graphs edge-Wiener index disjunctive product of graphs 05C76 05C12 05C38 |
| url | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/242 |
| work_keys_str_mv | AT azarim ontheedgewienerindexofthedisjunctiveproductofsimplegraphs AT iranmanesha ontheedgewienerindexofthedisjunctiveproductofsimplegraphs |