Embedding of and + into Arbitrary Tree
Vijender Kumar, Anil Kumar · 2013
We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, Cn 2 , 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.