“Square Graphs” an Algorithmic Approach

Shreedevi V. Shindhe, H. B. Walikar,Ishwar Baidari, Ravikumar H. Roogi

Abstract


In this paper we have made an effort to co-op up Graph Theory with Euclidian Geometry, we adopt the notion of diameter in Graph Theory (largest length of a path in graph) as length and height of a graph as breadth of graph. The breadth of the graph is defined to be the maximum of the heights taken over all the diametral paths and is denoted by . Therefore . A graph is said to be a square graph if . An algorithm is developed to find the breadth of graph.

 

Keywords: height of path, breadth of graph, length of graph, diametral path, distance.


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v3i4.1279

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science