Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2004.06a
- /
- Pages.167-170
- /
- 2004
The S-Edge Numbering on Binomial trees
이항트리에서 S-에지번호 매김
-
Kim Yong-Seok
(Dept. of Computer Science and Communications, Seonam University)
-
김용석
(서남대학교 컴퓨터정보통신학과)
- Published : 2004.06.01
Abstract
We present a novel graph labeling problem called S-edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be
Keywords