The complicated networks in the nature are the recursive patterns which overlap with each other. These patterns can be captured by edge replacement graph grammars. In this paper, making use of edge replacement recursive graph grammar, we define context free edge replacement graph P system. The two variants of P system namely rewriting P system and P system with conditional communication are used with edge replacement recursive graph grammar. We exhibit the generation of some special kind of graphs such as double shell graph, shell butterfly graph and banana trees graph using context-free edge replacement graph P system, besides establishing some comparison results.
Index Terms- Context- free, Edge Replacement,Graph Grammar, P system