Graph theory is one of the mainly essential branches in mathematics and is helpful to locate relations between various associated systems. By way of the appearance of systems as the Grid, it is very important to study the path finding and partitioning problems to understand the analogous capabilities of assorted systems. This premise helps in grid computing such as advance efficacy by designating data and distribute it globally. In this paper we study the spanning 2- connected subgraphs of rectangular grid graphs.
Impact Factor
2017: 6.614
This work is licensed under a