Abstract
The notion of addressing scheme Rosenberg [5] established in his theory of data graphs and addressing schemes is used as a linearizing concept for labelled graphs. The equivalence of this concept to the graph-specification model Culik II and Maurer [2] developed to describe so called selector-graphs in a linear way is shown. Further, two constructions which modify weakly non-linearizable graphs such that their modification are linearizable are given. Some considerations on the classification of the linearizations of labelled graphs in the sense of formal language theory are made and it is proved that the class of R-regular graphs possesses regular linearizations. Finally some results concerning operations on graphs which preserve linearizability and how linearizations of graphs can be represented by two parts such that one of them is finite are given.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Culik II, K./Maurer, H.A. "String Representations of Graphs" Rep. 50, Inst. f. Angew. Informatik u. formale Beschreibungsverfahren, Uni Karlsruhe, 1975
Culik II, K./Maurer, H.A. "Linearizing Selector-Graphs and Applications thereof" Angew. Informatik 9, 1977, p. 386–394
Inagaki, Y. et al. "Addressable Approximations to Nonaddressable Data Graphs" JCSS 17, 1978, p. 1–34
Majster, M.E. "Erweiterte gerichtete Graphen ein Modell für Datenstrukturen und Datenstrukturklassen" Diss. TU München, 1975
Rosenberg, A.L. "Data Graphs and Addressing Schemes" JCSS 5, 1971, p. 193–238
Rosenberg, A.L. "Generalized Addressing Schemes for Data Graphs" Math. Systems Theory 8, 1975, p. 353–366
Witt, K.-U. "Theorie adressiebarer Strukturen und ihrer Realisierungen" Diplom-Arbeit RWTH Aachen, 1978
Witt, K.-U. "Two Concepts for Linearizing Labelled Graphs" Discussion Paper 8006, Lehrst. f. Informatik III RWTH Aachen, 1980
Witt, K.-U. "Embedding Graphs in Discrete Spaces" Discussion Paper 8007, Lehrst. f. Informatik III RWTH Aachen, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witt, KU. (1981). On linearizing graphs. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive