Monophonic wirelength on Circulant Networks

  • Authors

    • K Uma Samundesvari Assistant Professor, Department of Mathematics, Ponjesly College ofEngineering, Nagercoil, 629003, India
    • Sindhuja G. Michael
    2018-06-23
    https://doi.org/10.14419/ijet.v7i3.12602
  • Circulant Networks, Edge Congestion, Grid, Monophonic Distance, Wirelength

  • In this paper, we define the monophonic embedding of graph G into graph H and we present an algorithm for finding the monophonic wirelength of circulant networks into the family of grids M(n×2), n≥2.The monophonic embedding of a graph G into a graph H is an embedding denoted by fm is a bijective map from the vertex set of G into the vertex set of H and fm is a one-one mapping from the edge set (x, y) of G into Pm(H) where Pm(H) is the set of monophonic paths between fm(x) and fm(y) for every fm(x), fm(y) H. The monophonic wirelength of fm of G into H is the sum of distances of monophonic paths between two vertices fm(x) and fm(y) in H such that (x, y) E(G). This paper presents a monophonic algorithm to find the monophonic wirelength of circulant networks G(2n, ±S) , where S {1,2,3,…,n} into the family of grids M[n×2],n≥2. We also derived a Lemma to get the monophonic edge congestion MEC(G,H).

     

     

  • References

    1. [1] Buckley F &Harary F, “Distance in Graphsâ€, Addison-Wesley, Redwood City, CA, (1990).

      [2] Santhakumaran AP & Titus P, “Monophonic distance in graphsâ€, Discrete Math, Algorithms and Appl., Vol.3, No.2, (2011), pp.159-169.https://doi.org/10.1142/S1793830911001176.

      [3] Maya P & Nicholas T, “Some Results on Integer Edge Cordial Graphâ€, DJ Journal of Engineering and Applied Mathematics, Vol.3, No.1, (2017), pp.1-2.https://doi.org/10.18831/djmaths.org/2017011001.

      [4] Mathew J, “Subdivided Stars Super (b, d)-Edge-Antimagic Total Graph Labellingâ€, DJ Journal of Engineering and Applied Mathematics, Vol.1, No.1, (2015), pp.30-34.https://doi.org/10.18831/djmaths.org/2015011005.

      [5] Rajasingh I, Manuel P, Arockiaraj M &Rajan B, “Embeddings of Circulant networksâ€, Journal of Combinatorial Optimization, Vol.26, No.1, (2011), pp.135-151.https://doi.org/10.1007/s10878-011-9443-x

      [6] Quadras J & Surya SS, “Linear wirelength of circulant networksâ€, International Journal of Pure and Applied Mathematics, Vol.86, No.6, (2013), pp.883-891.

      [7] Arokiaraj M, Manuel P, Rajasingh I &Rajan B, “Wirelength of 1-fault Hamiltonian graphs into wheels and fansâ€,Information Processing Letters, Vol.111, (2011) pp.921–925.https://doi.org/10.1016/j.ipl.2011.06.011

      [8] .Bezrukov SL, Chavez JD, Harper LH, Rottger M & Schroeder UP, “Embedding of hypercubes into gridsâ€, MFCS, Electronic Edition Springer, Lecture Notes in Computer Science, No.1450, (1998), pp.693-701.https://doi.org/10.1007/BFb0055820.

      [9] Manuel P, Rajasingh I, Rajan B & Mercy H, “Exact wirelength of hypercube on a gridâ€, Discrete Applied Mathematics, Vol.157, No.7, (2009), pp.1486 -1495.https://doi.org/10.1016/j.dam.2008.09.013.

  • Downloads

  • How to Cite

    Uma Samundesvari, K., & G. Michael, S. (2018). Monophonic wirelength on Circulant Networks. International Journal of Engineering & Technology, 7(3), 1154-1156. https://doi.org/10.14419/ijet.v7i3.12602