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.
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
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).
Gary S. Bloom, A counterexample to a theorem of S. Piccard. J. Combinatorial Theory, to appear.
A. R. Eckler, The construction of missile guidance codes resistant to random interference. Bell Syst. Technical J. 39 (1960) 973–944.
Joel N. Franklin, Ambiguities in the s-ray analysis of crystal structures. Acat Cryst. A30 (1974) 698–702.
Martin Gardner, Mathematical Games. Scientific American 226 (1972) 118–121.
Solomon W. Golobm, How to number a graph. Graph Theory and Computing. Academic Press, New York (1972) 23–37.
Solomon W. Golomb, The largest graceful subgraph of the complete graph. Amer. Math. Monthly 81 (1974) 499–501.
John Leech, On the representation of 1,2,...,n by differences. J. London Math. Soc. 31 (1956) 160–169.
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.
S. Piccard, Sur les Ensembles de Distance des Ensembles d'un Espace Euclidean. Librarie Gauthier-Villars & Cie, Paris (1939).
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.
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.
B. Wichmann, A note on restricted difference bases. J. London Math. Soc. 38 (1963) 465–466.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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