Abstract
A labeled 2-structure, ℓ2s for short, is a complete edge-labeled directed graph without loops or multiple edges. An important result of the theory of 2-structures is the existence of a hierarchical representation of each ℓ2s. A δ-reversible labeled 2-structure g will be identified with its labeling function that maps each edge (x, y), x ≠ y, of the domain D into a group Δ so that g(y, x)=δ(g(x, y)) for an involution δ of Δ. For each mapping (selector) Δ:D → ‡ a δ-reversible 2-structure g σ is obtained from g by g σ(x, y)=ρ(x)g(x, y)δ(ρ(y)). A dynamic δ-reversible 2-structure G=[g] generated by g is the set {g σ¦ σ a selector}. We define the plane trees of G to capture the hierarchical representation of G as seen by individual elements of the domain. We show that all the plane trees are strongly related to each other. Indeed, they are all obtainable from one simple unrooted undirected tree — the form of G. Thus, quite surprisingly, all hierarchical representations of ℓ2s's belonging to one dynamic ℓ2s G can be combined into one hierarchical representation of G.
The authors are grateful to BRA Working Groups ASMICS, COMPUGRAPH and Stiltjes Institute for their support.
Preview
Unable to display preview. Download preview PDF.
References
Buer, H. and R.H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983) 170–184.
Ehrenfeucht, A., T. Harju and G. Rozenberg, Permuting transformation monoids, Semigroup Forum 47 (1993) 123–125.
Ehrenfeucht, A., T. Harju and G. Rozenberg, Invariants of 2-structures on groups of labels, Manuscript (1994).
Ehrenfeucht, A. and G. Rozenberg, Theory of 2-structures, Parts I and II, Theoret. Comput. Sci. 70 (1990) 277–303 and 305–342.
Ehrenfeucht, A. and G. Rozenberg, Dynamic labeled 2-structures, Mathematical Structures in Computer Science, to appear.
Rotman J.J., The Theory of Groups: An Introduction, Allyn and Bacon, Boston, 1973.
Schmerl, J. H. and W. T. Trotter, Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures, Discrete Math. 113 (1993) 191–205.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrenfeucht, A., Harju, T., Rozenberg, G. (1996). Group based graph transformations and hierarchical representations of graphs. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_108
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive