GENERATION OF GRAPHS USING HYPER-EDGE REPLACEMENT GRAPH REWRITING P SYSTEM

GENERATION OF GRAPHS USING HYPER-EDGE REPLACEMENT GRAPH REWRITING P SYSTEM

K. Vinodhini, M. P. Sankar

[PDF]

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 bio- inspired model or a model of natural computing. The  eld of Membrane computing is  rst roused by the manner in which nature processes at the cell levels. In this paper, using the hyper-edge replacement graph rewriting P system, signi cant graphs like Snail graphs, Caterpillar graphs, Comb graphs, Fire Cracker graphs, and Wheel graphs are generated with hyper-edge rules of minimum order.

Keywords

Hyper-edge, Hyper-edge replacement graph grammar (HRG), Graph P sys- tem, Hyper-edge replacement graph rewriting P system (HRGRPS).