Indian Journal of Science and Technology
DOI: 10.17485/ijst/2016/v9i6/82458
Year: 2016, Volume: 9, Issue: 6, Pages: 1-5
Original Article
M. Tabitha Agnes1* and L. Sudershan Reddy2
1Visvesvaraya Technological University, Belgaum - 590014, Karnataka, India; [email protected] 2C.M.S Business School, Jain University, Bengaluru, Karnataka-560 078; India; [email protected]
*Author for Correspondence
M. Tabitha Agnes
Visvesvaraya Technological University, Belgaum - 590014, Karnataka, India; [email protected]
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
Subscribe now for latest articles and news.
