Abstract
A spelling net for a phrase consists of the multigraph whose points are labelled with the set of distinct letters in the phrase and whose lines lie on the Eulerian path obtained in "spelling out" the phrase between the (lettered) points. Spelling nets can also use phonemes or words as labels. An eodermdrome is a non-planar spelling net. Thus, the study of structural properties of eodermdromes is the study of non-planar Eulerian multigraphs.
In this paper we summarise what is known about eodermdromes and indicate how the properties of eodermdromes have potential for linguistic research. Some of the questions with interesting linguistic implications can be asked as questions about crossing numbers of graphs. We give 21 line critical graphs with crossing number 2 which belong to a set conjectured to characterise graphs with crossing number at most 1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. S. Bloom, J.W. Kennedy and P. Wexler; Ensnaring the elusive eodermdrome, Wordways, 13 (1980) 131–140.
G.S. Bloom, A. Gewirtz, J.W. Kennedy and P. Wexler; Eodermdromes: A graph theoretical tool for linguistics, in The Theory and Application of Graphs, (Eds., Gary Chartrand, et al.), Wiley, New York, (1981) 81–93.
G.S. Bloom and J.W. Kennedy; A Collection of Minimal EODERMDROMES; Research Report, Research Institute, Advanced Medical Products, (to appear).
P. Erdös and R.K. Guy; Crossing number problems, Amer. Math. Monthly, 80 (1973), 52–58.
R.K. Guy; Latest results on crossing numbers, Recent Trends in Graph Theory, Springer, New York (1971) 143–156.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass (1969).
J.W. Kennedy, P.W. Wexler and G.S. Bloom; Linguistic Complexity and minimal EODERMDROMES, Linguistics, 18 (1980), 3–16.
K. Zarankiewicz, On a problem of P. Turan concerning graphs, Fund. Math., 41 (1954) 137–145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Bloom, G.S., Kennedy, J.W., Quintas, L.V. (1983). On crossing numbers and linguistic structures. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071606
Download citation
DOI: https://doi.org/10.1007/BFb0071606
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12687-4
Online ISBN: 978-3-540-38679-7
eBook Packages: Springer Book Archive