Optimal Layout of Chord Graph into the Windmill Graph

Authors

  • Shalini MA P.G. Department of Mathematics, Women's Christian College, Chennai. India
  • Abraham J Department of Mathematics, Loyola College, Chennai, India
  • Aswathi D P.G. Department of Mathematics, Women's Christian College, Chennai. India

Keywords:

Embedding, chord graph, optimal set, windmill graph, layout

Abstract

Graph embedding is an important and extensively studied theory in parallel computing. A great deal of research has been devoted to finding “good” embedding of one network into another. The embedding of a guest graph G into a host graph H is defined by a pair of injective functions between them. The edge congestion of an embedding is the maximum number of edges of the guest graph that are embedded on any single edge of the host graph. The optimal layout problem deals with finding the embedding for which the sum of all the shortest paths in corresponding to the edges in is minimum. In this paper, we find the optimal layout of embedding the chord graph into the windmill graph

References

J. Abraham, “Optimal Node Ordering and Layout of Chord Graphs”, International Journal of pure and Applied Mathematics, vol. 119, no. 11, pp. 19-27, 2018.

M. Arockiaraj, J. Abraham, J. Quadras, A.J. Shalini, “Linear layout of locally twisted cubes”, International Journal of Computer Mathematics, vol. 94, no. 1, pp. 56-65, 2017.

M. Arockiaraj, J. Quadras, I. Rajasingh, A.J. Shalini, “Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees”, Discrete Optimization, vol. 17, pp. 1-13,2015.

Garey, M.R. and Johnson, D.S. “Computers and Intractability,” A Guide to the Theory of NP- Completeness, Freeman, San Francisco.

N. Parthiban, J. Ryan, I. Rajasingh, R.S. Rajan, L.N. Rani, “Exact Wirelength of embedding chord graph into tree-based architectures”, Int.J.Networking and Virtual Organisation , vol. 17, no. 1, pp. 76-87, 2017.

I. Rajasingh, P. Manuel, M. Arockiaraj, B. Rajan, “Embedding of circulant networks”, Journal of Combinatorial. Optimization, vol. 26, no. 1, pp. 135-151, 2013.

I. Rajasingh, B. Rajan, R.S. Rajan, “Embedding of hypercubes into necklace, Windmill and Snake graphs”, Information Processing Letter , vol. 112, pp. 509–515, 2012.

Rajasingh, I., Manuel, P.,Rajan, B. and Arockiaraj, M. “Wirelength of hypercubes into certain trees”, Discrete Applied Mathematics, vol.160, No. 18, pp.2778-2786, 2012a.

H. Rostami, J. Habibi, “Minimum linear arrangement of chord graphs”, Applied Mathematics and Computation, vol. 203, pp. 358– 367, 2008.

Xu, J.M. and Ma, M. “Survey on path and cycle embedding in some networks”, Frontiers of Mathematics in China, Vol. 4, pp.217-252, 2009

Downloads

Published

2025-11-25

How to Cite

[1]
M. A. J. Shalini, J. Abraham, and D. Aswathi, “Optimal Layout of Chord Graph into the Windmill Graph”, Int. J. Comp. Sci. Eng., vol. 7, no. 5, pp. 55–58, Nov. 2025.

Issue

Vol. 7 No. 5 (2019): IJCSE Special Issue Mar Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.