Open Access   Article Go Back

Optimal Layout of Chord Graph into the Windmill Graph

M Arul Jeya Shalini1 , Jessie Abraham2 , Aswathi D3

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-05 , Page no. 55-58, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si5.5558

Online published on Mar 10, 2019

Copyright © M Arul Jeya Shalini, Jessie Abraham, Aswathi D . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: M Arul Jeya Shalini, Jessie Abraham, Aswathi D, “Optimal Layout of Chord Graph into the Windmill Graph,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.55-58, 2019.

MLA Style Citation: M Arul Jeya Shalini, Jessie Abraham, Aswathi D "Optimal Layout of Chord Graph into the Windmill Graph." International Journal of Computer Sciences and Engineering 07.05 (2019): 55-58.

APA Style Citation: M Arul Jeya Shalini, Jessie Abraham, Aswathi D, (2019). Optimal Layout of Chord Graph into the Windmill Graph. International Journal of Computer Sciences and Engineering, 07(05), 55-58.

BibTex Style Citation:
@article{Shalini_2019,
author = {M Arul Jeya Shalini, Jessie Abraham, Aswathi D},
title = {Optimal Layout of Chord Graph into the Windmill Graph},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {55-58},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=804},
doi = {https://doi.org/10.26438/ijcse/v7i5.5558}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.5558}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=804
TI - Optimal Layout of Chord Graph into the Windmill Graph
T2 - International Journal of Computer Sciences and Engineering
AU - M Arul Jeya Shalini, Jessie Abraham, Aswathi D
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 55-58
IS - 05
VL - 07
SN - 2347-2693
ER -

           

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 e of the host graph. The optimal layout problem deals with finding the embedding for which the sum of all the shortest paths in H corresponding to the edges in G is minimum. In this paper, we find the optimal layout of embedding the chord graph into the windmill graph.

Key-Words / Index Term

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

References

[1] 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.
[2] 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.
[3] 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.
[4] Garey, M.R. and Johnson, D.S. “Computers and Intractability,” A Guide to the Theory of NP- Completeness, Freeman, San Francisco.
[5] 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.
[6] I. Rajasingh, P. Manuel, M. Arockiaraj, B. Rajan, “Embedding of circulant networks”, Journal of Combinatorial. Optimization, vol. 26, no. 1, pp. 135-151, 2013.
[7] 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.
[8] 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.
[9] H. Rostami, J. Habibi, “Minimum linear arrangement of chord graphs”, Applied Mathematics and Computation, vol. 203, pp. 358–367, 2008.
[10] 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.