Journal of the Institute of Electronics Engineers of Korea CI (전자공학회논문지CI)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

The Research of Q-edge Labeling on Binomial Trees related to the Graph Embedding

그래프 임베딩과 관련된 이항 트리에서의 Q-에지 번호매김에 관한 연구

  • Kim Yong-Seok (Department of Computer and Information Communications, Chonbuk Seonam University)
  • 김용석 (서남대학교, 컴퓨터 정보통신학과)
  • Published : 2005.01.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose the Q-edge labeling method related to the graph embedding problem in binomial trees. This result is able to design a new reliable interconnection networks with maximum connectivity using Q-edge labels as jump sequence of circulant graph. The circulant graph is a generalization of Harary graph which is a solution of the optimal problem to design a maximum connectivity graph consists of n vertices End e edgies. And this topology has optimal broadcasting because of having binomial trees as spanning tree.

본 논문에서는 그래프 임베딩 문제와 관련된 이항트리에서의 Q-에지 번호매김 방법을 제안한다. 이러한 연구결과는 신뢰성이 높은 통신망을 설계하는 최적화 문제인 "n 개의 노드와 e 개의 에지를 가지면서 연결도가 최대인 그래프를 구성하라."를 해결한 Harary 그래프의 일반화인 원형군 그래프(circulant graph)의 점프열로 Q-에지번호들을 이용하면 연결도가 최대인 신뢰성이 높은 새로운 상호연결망(interconnection networks)의 위상을 설계할 수 있다. 그리고 이러한 위상은 이항트리를 스패닝 트리로 가지므로 최적방송이 가능하다.

Keywords

References

  1. Y. Yang and J. Wangr, Routing Permutations with link-disjoint and node-disjoint paths in a class of self-routable interconnects, IEEE trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 383-393, Apr. 2003 https://doi.org/10.1109/TPDS.2003.1195410
  2. L. H. harper, Optimal numbering and isoperimetric problems on graph, J. Combiantorial Theory 1 (1966) pp. 385-393
  3. M. R. Brown, Implementation and analysis of binomial queue algorithms, SIAM J. Comput. 7 (1978) pp. 298-319 https://doi.org/10.1137/0207026
  4. V. M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. A. Mohamed and J. Telle, Mapping Divide-and-Conquer Algorithms to Parallel Architectures, Proc. of the 1990 International Conf. on Parallel Procesing, Vol. III, pp. 128-135 Aug. 1990
  5. W. J. Hsu, C. B. Page and J. S. Liu, Computing Prefixes on a Large Family of Interconnection Topologies, Proc. of the 1992 International Conf. on Parallel Processing, Vol. III, pp. 153-159, Aug. 1992
  6. H.-S. Lim, On the Labelings of Graphs and their Applications, Ph.D. Thesis, Dept. Computer Science, KAIST, 1993
  7. F. Harary, 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
  8. J.-H. Park, Circulant Graphs and their Application to Communication Networks, Ph.D. Thesis, Dept. Computer Science, KAIST, 1992
  9. 박정흠, 좌경룡, 재귀원형군과 하이퍼큐브의 임베딩, 정보과학회 논문지, 제22권 A편, 제12호, 1736-1741쪽, 1995년 12월
  10. D. A. Reed and H. A. Fujimoto, Multicomputer Networks: Massage-based Parallel Processing, M IT Press, 1987
  11. S. W. Golomb, 'How to number a graph,' Graph Theory and Computing, Academic Press, New York (1972) pp. 23-37
  12. F. R. K. 'Some problems and results in labelings of graphs,' The Theory and Application of graphs, G. Chartrand. ed., Wiley, New York (1981) pp. 255-263
  13. J. A. Bondy and U. S. R. Murty, Graph theory with applications, North-Holland, New York, 1976
  14. F.T.Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hyper -cubes, Morgan Kaufmann publishers, San Mateo, California, 1992