A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Monophonic Wirelength in Graph Embedding

2018
*
International Journal of Engineering & Technology
*

In this paper we consider the monophonic embedding ofcirculant networks into cycles and we produce an algorithmto get the monophonic wirelength of the same.Further wend that the monophonic wirelength of some family of cir-In this paper, we define the monophonic embedding of graph G into another graph H and this paper presents a monophonic algorithm to find the monophonic wirelength of circulant networks G[n, ±S], where S ⊆ {1,2,3,...,n/2} into the family of Cycle Cn, n≥ 4. The mono-phonic

doi:10.14419/ijet.v7i3.12603
fatcat:cgymjxumpbewlpqpazdhdeanpq