Gd-Distance of Wreath Product of Graphs

Abstract Let G = (V, E) be a simple connected graph. The geodesic distance between two vertices u, v in G is the length in terms of the number of edges of the shortest path between the vertices. In this paper, we determine the Gd-distance of wreath product of two graphs. Using the formulae obtained...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1947; no. 1; pp. 12033 - 12043
Main Authors Thanga Kanniga, K., Maheswari, V., Palani, K.
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.06.2021
Subjects
Apexes
Gadolinium
Gd-distance
Graph theory
Graphs
Shortest-path problems
Wiener index
Wreath Product
Online AccessGet full text

Cover

More Information
Summary:Abstract Let G = (V, E) be a simple connected graph. The geodesic distance between two vertices u, v in G is the length in terms of the number of edges of the shortest path between the vertices. In this paper, we determine the Gd-distance of wreath product of two graphs. Using the formulae obtained here, we have found the exact value of the geodesic distance of some classes of graphs.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1947/1/012033