DIAMETRAL PATHS IN EXTENDED TRANSFORMATION GRAPHS

In a graph, diametral path is shortest path between two vertices which has length equal to diameter of the graph. Number of diametral paths plays an important role in computer science and civil engineering. In this paper, we introduce the concept of extended transformation graphs. There are 64 exten...

Full description

Saved in:
Bibliographic Details
Published in:TWMS journal of applied and engineering mathematics 2021-01, Vol.11 - Special Issue (Jaem Vol 11 - Special Issue, 2021), p.75
Main Authors: Garg, P, Sharma, M
Format: Article
Language:English
Subjects:
Apexes
Graph theory
Graphs
Shortest-path problems
Transformations
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a graph, diametral path is shortest path between two vertices which has length equal to diameter of the graph. Number of diametral paths plays an important role in computer science and civil engineering. In this paper, we introduce the concept of extended transformation graphs. There are 64 extended transformation graphs. We obtain number of diametral paths in some of the extended transformation graphs and we also study the semi-complete property of these extended transformation graphs. Further, a program is given for obtaining number of diametral paths.
ISSN:2146-1147