Numbered complete graphs, unusual rulers, and assorted applications
暂无分享,去创建一个
[1] Arthur J. Bernstein,et al. A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.
[2] A. R. Eckler. The construction of missile guidance codes resistant to random interference , 1960 .
[3] Ronald C. Read,et al. Graph theory and computing , 1972 .
[4] Solomon W. Golomb. The Largest Graceful Subgraph of the Complete Graph , 1974 .
[5] B. Wichmann. A Note on Restricted Difference Bases , 1963 .
[6] J. Franklin,et al. Ambiguities in the X‐ray analysis of crystal structures , 1974 .
[7] John Leech,et al. On the Representation of 1, 2, …, n by Differences , 1956 .
[8] Solomon W. Golomb,et al. HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. , 1972 .