References
- D. A. Reed and H. A. Fujimoto, 'Multicomputer Networks: Massage-based Parallel Processing', MIT Press, 1987.
- F. T. Leighton, 'Introduction to parallel algorithms and architectures: arrays, trees, hypercubes', Morgan Kaufmann publishers, San Mateo, California, 1992.
- S. W. Golomb, 'How to number a graph', Graph Theory and Computing, Academic Press, New York (1972) pp.23-37.
- F. R. K. 'Some problems and a graph' Graph Theory and Computing, Academic Press, New York (1972) pp.23-37.
- J. A. Bondy and U. S. R. Murty 'Graph theory with applications', North-Holland, New York, 1976.
- L. H. Harper, "Optimal numbering and isoperimetric problems on graph," J. Combinatorial Theory (1966) pp.385-393.
- J.-H. Park, K.-Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theorectical Computer Science, pp.35-62. 2000
- N. L. Prashanna, K. Sravanthi and N. Sudhakar, "Applications of Graph Labeling in Communication Netwoks," Oriental Journal of Computer Science & Technology, Vol.7, pp.139-145 Apr., 2014.
- N. Lakshmiprasanna K. Sravanthi, Nagalla Sudhakar "Applications of Graph Labeling in Major Areas of Computer Science", IJRCCT, Vol.3, pp.819-823, Aug., 2014.
- H. -S. Lim, J. -H. Park and K. -Y. Chwa, "Embedding Trees in Recursive Circulants," Discrete Applied Mathematics, Vol.4, No.10, pp.1105-1117, 1993.
- J. Choi, Optimal Broadcasting and Complete Ternary Tree Embedding based on Multinomal Trees in Recursive Circulants, Ph. D. Thesis, Dept. of Computer Science, CNU, Kwangju, Korea, 1999.
- F, Harray, "The maximum connectivity of a graph," Proc. Nat. Acad. Sci. U.S.A., Vol.48, pp.1142-1146, 1962. https://doi.org/10.1073/pnas.48.7.1142