M. Tabitha Agnes ¹, L. Sudershan Reddy ²

Affiliations
1 Visvesvaraya Technological University, Belgaum - 590014, Karnataka, IN
2 C.M.S Business School, Jain University, Bengaluru-560 078, Karnataka, IN

Abstract

Weighted peripheral graph Gd of a graph G has the peripheral vertices of G as its vertices and the diametral paths between the peripheral vertices of G as its edges. The structural properties of this weighted graph for some classes of graphs are discussed and bounds of certain parameters are identified. For the C# program developed to determine the parameters involved in the study, corresponding output for a sample graph is also presented. Remote nodes, high priority routes between them and strategic location problems of real life networks are some areas where these results can be applied.

Keywords

Central Vertex, Diameter, Diametral Path, Peripheral Vertex, Radius, Weighted Graph, Weighted Peripheral Graph

Full Text