Skip to main content

Numbered complete graphs, unusual rulers, and assorted applications

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

Abstract

A variety of physical processes can be modelled by assigning integer values to the points and edges of complete graphs. A survey was made of three such numberings, their relation to "ruler models," and their applications to x-ray crystallography, to codes for radar, missile guidance, and angular synchronization, to convolutional codes, to addressing in communications networks, and to an integral voltage generator.

Keywords

  • Complete Graph
  • Pulse Train
  • Code Word
  • Convolutional Code
  • Ruler Model

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.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. Gary s. Bloom, Numbered Undirected Graphs and Their Uses: A Survey of a Unifying Scientific and Engineering Concept and its Use in Developing a Theory of Non-Redundant Homometric Sets Relating to Some Ambiguities in X-Ray Diffraction Analysis. Dissertation, University of Couthern California, Los Angeles (1975).

    Google Scholar 

  2. Gary S. Bloom, A counterexample to a theorem of S. Piccard. J. Combinatorial Theory, to appear.

    Google Scholar 

  3. A. R. Eckler, The construction of missile guidance codes resistant to random interference. Bell Syst. Technical J. 39 (1960) 973–944.

    MathSciNet  Google Scholar 

  4. Joel N. Franklin, Ambiguities in the s-ray analysis of crystal structures. Acat Cryst. A30 (1974) 698–702.

    CrossRef  Google Scholar 

  5. Martin Gardner, Mathematical Games. Scientific American 226 (1972) 118–121.

    Google Scholar 

  6. Solomon W. Golobm, How to number a graph. Graph Theory and Computing. Academic Press, New York (1972) 23–37.

    Google Scholar 

  7. Solomon W. Golomb, The largest graceful subgraph of the complete graph. Amer. Math. Monthly 81 (1974) 499–501.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. John Leech, On the representation of 1,2,...,n by differences. J. London Math. Soc. 31 (1956) 160–169.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J. C. P. Miller, Difference bases, three problems in additive number theory. Computers in Number Theory (eds. A. D. L. Atkin and B. J. Birch). Academic Press, London (1971) 299–322.

    Google Scholar 

  10. S. Piccard, Sur les Ensembles de Distance des Ensembles d'un Espace Euclidean. Librarie Gauthier-Villars & Cie, Paris (1939).

    Google Scholar 

  11. John R. Robinson and Arthur J. Bernstein, A class of binary recurrent codes with limited error propagation. IEEE Trans. on Information Theory IT-13 (1967) 106–113.

    CrossRef  Google Scholar 

  12. G. J. Simmons, Synch sets: A variant of difference sets. Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Computing. Utilitas Mathematica Publishing, Winnipeg (1974) 625–645.

    Google Scholar 

  13. B. Wichmann, A note on restricted difference bases. J. London Math. Soc. 38 (1963) 465–466.

    CrossRef  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

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, G.S., Golomb, S.W. (1978). Numbered complete graphs, unusual rulers, and assorted applications. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070364

Download citation

  • DOI: https://doi.org/10.1007/BFb0070364

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive