Paper Info
Title
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions
Abstract
.   In this paper, we consider derivation trees in apex NLC graph languages. We show that for every graph H in arbitrary apex NLC graph language, a decomposition tree of H can be constructed from a derivation tree of H. We also show that there exists a hierarchy in the class of apex NLC graph languages when we restrict the number of nonterminals in the right-hand sides of productions in apex NLC graph grammars.
Year
DOI
Venue
1997
10.1007/s002360050087
Acta Inf.
Field
DocType
Volume
Discrete mathematics,Combinatorics,Line graph,Wagner graph,Simplex graph,Null graph,Apex graph,Butterfly graph,Mathematics,Voltage graph,Complement graph
Journal
34
Issue
ISSN
Citations 
5
0001-5903
0
PageRank 
References 
Authors
0.34
19
1
Name
Order
Citations
PageRank
Koichi Yamazaki122221.85