Embedding of and + into Arbitrary Tree

Abstract

We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, Cn , and Cn 2 −1 + K1 into arbitrary tree. The embedding algorithms use a technique based on consecutive label property. Our algorithm calculates edge congestion in linear time.

Cite this paper

@inproceedings{Kumar2013EmbeddingOA, title={Embedding of and + into Arbitrary Tree}, author={Vijender Kumar and A. Vincent Antony Kumar}, year={2013} }