Skip to main content

On crossing numbers and linguistic structures

Part of the Lecture Notes in Mathematics book series (LNM,volume 1018)

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.

Keywords

  • Linguistic Research
  • Linguistic Structure
  • Line Transitivity
  • English Spelling
  • Proper Subgraph

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. S. Bloom, J.W. Kennedy and P. Wexler; Ensnaring the elusive eodermdrome, Wordways, 13 (1980) 131–140.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. G.S. Bloom and J.W. Kennedy; A Collection of Minimal EODERMDROMES; Research Report, Research Institute, Advanced Medical Products, (to appear).

    Google Scholar 

  4. P. Erdös and R.K. Guy; Crossing number problems, Amer. Math. Monthly, 80 (1973), 52–58.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. R.K. Guy; Latest results on crossing numbers, Recent Trends in Graph Theory, Springer, New York (1971) 143–156.

    MATH  Google Scholar 

  6. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass (1969).

    MATH  Google Scholar 

  7. J.W. Kennedy, P.W. Wexler and G.S. Bloom; Linguistic Complexity and minimal EODERMDROMES, Linguistics, 18 (1980), 3–16.

    CrossRef  Google Scholar 

  8. K. Zarankiewicz, On a problem of P. Turan concerning graphs, Fund. Math., 41 (1954) 137–145.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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