Embedding of C_n^2 and C_(n-1)^2+K_1 in to Arbitrary Tree
Vijender Kumar, Anil Kumar · International Journal of Computer Applications · 2013
We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, C n 2 , and C n 2 -1 + K 1 into arbitrary tree.The embedding algorithms use a technique based on consecutive label property.Our algorithm calculates edge congestion in linear time.