NLC GRAPH GRAMMAR FOR GENERATING GRAPH CLASSES

Print ISSN: 0972-7752 | Online ISSN: 2582-0850

Volume : 21 , Issue : Proceedings
Author :
S. Therasa (Department of Mathematics, University College of Engineering, Tiruchirappalli - 620024, Tamil Nadu, INDIA)
T. Rajaretnam (Department of Mathematics, St. Joseph s College, Tiruchirappalli - 620002, Tamil Nadu, INDIA)
S. Arumugam (Department of Computer Science and Engineering, Ramco Institute of Technology, Rajapalayam - 626117, Tamil Nadu, INDIA)

Abstract

In a node label controlled (NLC) graph grammar, a node $v$ of a given graph $G$ is replaced by a new graph $H$ and vertices of $H$ are connected to vertices in $G-v$, depending on how the node $v$ was connected to vertices in $G-v$. Terminal and non-terminal labels are used to label the vertices of $G$ and node replacement is a node label controlled mechanism. In this paper, we define NLC graph grammar for generating classes of graphs such as paths, cycles, wheels and complete bipartite graphs.

Keywords and Phrases

NLC graph grammar, node replacement, derivation.

A.M.S. subject classification

68Q01, 68R10, 68Q10.

.....

View PDF Click here to Subscribe now