Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


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
User