Abstract

Learning Fullerene Structures by Graph Grammars

Thanga Murugeshwari. V1* and Emerald Princess Sheela J.D2

1Research Scholar , Department of Mathematics, Queen Mary’s College, Chennai-4, Tamil Nadu, INDIA. 2Assistant Professor, Department of Mathematics, Queen Mary’s College, Chennai-4, Tamil Nadu, INDIA.

ABSTRACT

In this paper, some infinite classes of fullerene graphs are generated using hyperedge replacement graph grammars and a learning algorithm is discussed to learn some infinite classes of fullerene graphs. This paper is an impact of Jeltsch and Kreowski work on Grammatical Inference based on Hyperedge replacement ,to study some infinite classes of fullerene graphs. AMS (2010): 68Q42, 68R10, 97R40.

Keywords :Graph Grammars, Hyperedge replacement, Fullerene.

map1 map2 map3