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

@inproceedings{YongSeok2005TheRO,
  title={The Research of Q-edge Labeling on Binomial Trees related to the Graph Embedding},
  author={Kim Yong-Seok},
  year={2005}
}
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… CONTINUE READING