Generation of graphs using hyper-edge replacement graph rewriting P system

Abstract

Hyper-edge replacement graph grammar is considered a kernel in generating graphs and hypergraphs, and it has stood out enough to be noticed in recent years. George Paun proposed Membrane computing, frequently known as P system, as a bioinspired model or a model of natural computing. The field of Membrane computing is first roused by the manner in which nature processes at the cell levels. In this paper, using the hyper-edge replacement graph rewriting P system, significant graphs like Snail graphs, Caterpillar graphs, Comb graphs, Fire Cracker graphs, and Wheel graphs are generated with hyper-edge rules of minimum order.