Browse > Article
http://dx.doi.org/10.3745/KTCCS.2015.4.2.37

The Research of the 2-Edge Labeling Methods on Binomial Trees  

Kim, Yong Seok (서남대학교 컴퓨터정보학과)
Publication Information
KIPS Transactions on Computer and Communication Systems / v.4, no.2, 2015 , pp. 37-40 More about this Journal
Abstract
In this paper, we present linear, varied and mixed edge labeling methods using 2-edge labeling on binomial trees. As a result of this paper, we can design the variable topologies to enable optimal broadcasting with binomial tree as spanning tree, if we use these edge labels as the jump sequence of a sort of interconnection networks, circulant graph, with maximum connectivity and high reliability.
Keywords
Binomial Tree; Edge Labeling; Circulants; Spanning Tree; Optimal Broadcasting;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. A. Reed and H. A. Fujimoto, 'Multicomputer Networks: Massage-based Parallel Processing', MIT Press, 1987.
2 F. T. Leighton, 'Introduction to parallel algorithms and architectures: arrays, trees, hypercubes', Morgan Kaufmann publishers, San Mateo, California, 1992.
3 S. W. Golomb, 'How to number a graph', Graph Theory and Computing, Academic Press, New York (1972) pp.23-37.
4 F. R. K. 'Some problems and a graph' Graph Theory and Computing, Academic Press, New York (1972) pp.23-37.
5 J. A. Bondy and U. S. R. Murty 'Graph theory with applications', North-Holland, New York, 1976.
6 L. H. Harper, "Optimal numbering and isoperimetric problems on graph," J. Combinatorial Theory (1966) pp.385-393.
7 J.-H. Park, K.-Y. Chwa, "Recursive circulants and their embeddings among hypercubes," Theorectical Computer Science, pp.35-62. 2000
8 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.
9 N. Lakshmiprasanna K. Sravanthi, Nagalla Sudhakar "Applications of Graph Labeling in Major Areas of Computer Science", IJRCCT, Vol.3, pp.819-823, Aug., 2014.
10 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.
11 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.
12 F, Harray, "The maximum connectivity of a graph," Proc. Nat. Acad. Sci. U.S.A., Vol.48, pp.1142-1146, 1962.   DOI