Graph theoretic closure properties of the family of boundary NLC graph languages
- 23 Downloads
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.
The present paper continues the investigations of basic properties of BNLC grammars and languages where the central question is the following: “If L is a BNLC language and P is a graph theoretic property, is the set of all graphs from L satisfying P again a BNLC language?” We demonstrate that the class of BNLC languages is very “stable” in the sense that for almost all properties we consider the resulting languages are BNLC. In particular, the above question gets an affirmative answer, if the property P is: being k-colorable, being connected, having a subgraph homeomorphic to a given graph, and being nonplanar.
Unable to display preview. Download preview PDF.
- 1.Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. London: Macmillan 1976Google Scholar
- 2.Brandenburg, F.J.: On the complexity of the membership problem for graph grammars. In: Proceedings of the WG 83. (M. Nagl and J. Perl eds.), pp. 40–49. Linz: Universitätsverlag Trauner 1983Google Scholar
- 3.Ehrenfeucht, A., Main, M.G., Rozenberg, G.: Restrictions on NLC grammars. Theor. Comput. Sci. 31, 211–223 (1984)Google Scholar
- 4.Ehrig, H.: Introduction to the algebraic theory of graph grammars. Lect. Notes Comput. Sci. 73, 1–69 (1979)Google Scholar
- 5.Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP- completeness. San Francisco: Freeman 1979Google Scholar
- 6.Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237–267 (1976)Google Scholar
- 7.Ginsburg, S.: The Mathematical Theory of Context-Free Languages. New York: McGraw-Hill 1966Google Scholar
- 8.Gurari, E.H., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the min-cut arrangement problem. J. Algorithms 5, 531–546 (1984)Google Scholar
- 9.Harary, F.: Graph Theory. Reading, M.A.: Addison Wesley 1969Google Scholar
- 10.Janssens, D.: Node Label Controlled Graph Grammars. Ph.D. Thesis, University of Antwerp 1983Google Scholar
- 11.Janssens, D., Rozenberg, G.: On the structure of node label controlled graph languages. Inf. Sci. 20, 191–216 (1980)Google Scholar
- 12.Janssens, D., Rozenberg, G.: Restrictions, extensions, and variations of NLC grammars. Inf. Sci. 20, 217–244 (1980)Google Scholar
- 13.Janssens, D., Rozenberg, G.: Decision problems for node label controlled graph grammars. J. Comput. Syst. Sci. 22, 144–174 (1981)Google Scholar
- 14.Janssens, D., Rozenberg, G., Welzl, E.: The bounded degree problem for NLC grammars is decidable. J. Comput. Syst. Sci. (1986, in press)Google Scholar
- 15.Nagl, M.: A tutorial and bibliographical survey of graph grammars. Lect. Notes Comput. Sci. 73, 70–126 (1979)Google Scholar
- 16.Rozenberg, G., Welzl, E.: Boundary NLC graph grammars — basic definitions, normal forms and complexity. Inf. Control (1986, in press)Google Scholar
- 17.Salomaa, A.: Formal Languages. London: Academic Press 1973Google Scholar
- 18.Saxe, J.B.: Dynamic programming algorithms for recognizing small band width graphs in polynomial time. SIAM J. Algebraic Discrete Methods 1, 363–369 (1980)Google Scholar
- 19.Turán, G.: On the complexity of graph grammars. Acta Cybern. 6, 271–281 (1983)Google Scholar