IJPAM: Volume 75, No. 2 (2012)
GRAPHS BEFORE AND AFTER FOLDING
Faculty of Science
Abstract. In this paper we will compute shortest path algorithm for some graphs before and after folding and we will show that the algorithm change for once and the algorithm will not be change in bipartite graph whatever we start at parent vertex or child. Finally if the geometric shape change then the algorithm change.
Received: April 27, 2011
AMS Subject Classification: 05C85, 68R10
Key Words and Phrases: graph algorithm, folding
Download paper from here.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395