Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v. The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v)...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2017/4180650 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832567237233344512 |
|---|---|
| author | S. Kavithaa V. Kaladevi |
| author_facet | S. Kavithaa V. Kaladevi |
| author_sort | S. Kavithaa |
| collection | DOAJ |
| description | The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v. The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v) is the longest distance between vertices u and v. In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined. |
| format | Article |
| id | doaj-art-7c1edb0f9ae94f3f97bc584904c406eb |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-7c1edb0f9ae94f3f97bc584904c406eb2025-02-03T01:01:59ZengWileyJournal of Applied Mathematics1110-757X1687-00422017-01-01201710.1155/2017/41806504180650Gutman Index and Detour Gutman Index of Pseudo-Regular GraphsS. Kavithaa0V. Kaladevi1R&D Centre, Bharathiar University, Coimbatore, IndiaResearch Department of Mathematics, Bishop Heber College, Tiruchirappalli, Tamil Nadu 620017, IndiaThe Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v. The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v) is the longest distance between vertices u and v. In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.http://dx.doi.org/10.1155/2017/4180650 |
| spellingShingle | S. Kavithaa V. Kaladevi Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs Journal of Applied Mathematics |
| title | Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs |
| title_full | Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs |
| title_fullStr | Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs |
| title_full_unstemmed | Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs |
| title_short | Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs |
| title_sort | gutman index and detour gutman index of pseudo regular graphs |
| url | http://dx.doi.org/10.1155/2017/4180650 |
| work_keys_str_mv | AT skavithaa gutmanindexanddetourgutmanindexofpseudoregulargraphs AT vkaladevi gutmanindexanddetourgutmanindexofpseudoregulargraphs |