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


KIPS Transactions on Computer and Communication Systems, Vol. 4, No. 2, pp. 37-40, Feb. 2015
10.3745/KTCCS.2015.4.2.37,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. S. Kim, "The Research of the 2-Edge Labeling Methods on Binomial Trees," KIPS Transactions on Computer and Communication Systems, vol. 4, no. 2, pp. 37-40, 2015. DOI: 10.3745/KTCCS.2015.4.2.37.

[ACM Style]
Yong Seok Kim. 2015. The Research of the 2-Edge Labeling Methods on Binomial Trees. KIPS Transactions on Computer and Communication Systems, 4, 2, (2015), 37-40. DOI: 10.3745/KTCCS.2015.4.2.37.