Applications of numbered undirected graphs
- 1 April 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 65 (4) , 562-570
- https://doi.org/10.1109/proc.1977.10517
Abstract
Numbered undirected graphs are becoming an increasingly useful family of mathematical models for a broad range of applications. They have found usage in various coding theory problems, including the design of good radar-type codes, synch-set codes and convolutional codes with optimal autocorrelation properties. They facilitate the optimal nonstandard encodings of integers. They have also been applied to determining ambiguities in X-ray crystallographic analysis, to design of a communication network addressing system, to determination of optimal circuit layouts, and to problems in additive number theory. An attempt has been made to systematically present all of these diverse applications in a unifying framework and to indicate the existence of additional applications and to suggest directions for additional research.Keywords
This publication has 29 references indexed in Scilit:
- On sets of differencesAdvances in Mathematics, 1977
- Optimal labelling of a product of two pathsDiscrete Mathematics, 1975
- Another Tree Labelling ProblemThe American Mathematical Monthly, 1975
- Comments and ComplementsThe American Mathematical Monthly, 1974
- The Largest Graceful Subgraph of the Complete GraphThe American Mathematical Monthly, 1974
- Notes on the Representation of 1,2, ……, N by differencesJournal of the London Mathematical Society, 1972
- Minimization of mean-square error for data transmitted via group codesIEEE Transactions on Information Theory, 1969
- Encoding of analog signals for binary symmetric channelsIEEE Transactions on Information Theory, 1966
- Note on Restricted Difference BasesJournal of the London Mathematical Society, 1957
- On the Representation of 1, 2, …, n by DifferencesJournal of the London Mathematical Society, 1956