Graph Grammar for Parikh Word Representable Graphs

Abstract

Graph grammars are capable of modelling the generation of various families of graphs. Graph rewriting has basically two different approaches namely, node replacement and edge replacement rewriting. A variant of node replacement graph grammar called $nc-eNCE$ graph grammars was introduced recently. Recently, a special kind of graph, called Parikh word representable graph was introduced and its properties were studied. The problem of generation of graph structures using graph grammars has been considered in many studies. Here we generate the Parikh word representable graphs using $nc-eNCE$ graph grammars.