Combinatorial properties of boundary NLC graph languages

Abstract Node label controlled (NLC) grammars are graph grammars (operating on node labeled undirected graphs)which rewrite single nodes only and establish connections between the embedded graph and the neighbors of the rewritten node on the basis of the labels of the involved nodes only. They define (possibly infinite) languages of undirected node labeled graphs (or, if we just omit the labels, languages of unlabeled graphs). Boundary NLC (BNLC) grammars are NLC grammars with the property that whenever - in a graph already generated - two nodes may be rewritten, then these nodes are not adjacent. The graph languages generated by this type of grammars are called BNLC languages. In this paper we investigate the behaviour of graph invariants within BNLC languages. First we demonstrate that there is a dependency between the chromatic number and the clique number of graphs in BNLC languages (while this is wellknown not to be true for arbitrary graph languages). Secondly, we introduce a new graph invariant, the so-called index of a graph which seems to be very suitable for describing the adjacency structure of a graph. Then we prove that every BNLC language is of bounded index (which is shown not to be true for arbitrary graph languages). Thus we exhibit properties (concerning graph invariants) of BNLC languages which are intrinsic to this class. We use them to demonstrate that certain graph languages are not BNLC languages.

[1]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .

[2]  György Turán,et al.  On the complexity of graph grammars , 1983, Acta Cybernetica.

[3]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[4]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[5]  Grzegorz Rozenberg,et al.  Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

[6]  Grzegorz Rozenberg,et al.  Decision Problems for Node Label Controlled Graph Grammars , 1981, J. Comput. Syst. Sci..

[7]  Grzegorz Rozenberg,et al.  Restrictions, extensions, and variations of NLC grammars , 1980, Inf. Sci..

[8]  Grzegorz Rozenberg,et al.  The Bounded Degree Problem for NLC Grammars is Decidable , 1986, J. Comput. Syst. Sci..

[9]  Manfred Nagl,et al.  A Tutorial and Bibliographical Survey on Graph Grammars , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[10]  Franz-Josef Brandenburg.  On the Complexity of the Membership Problem of Graph Grammars , 1983, WG.

[11]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[12]  Andrzej Ehrenfeucht,et al.  Restrictions on NLC Graph Grammars , 1984, Theor. Comput. Sci..

[13]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.