Optimal Linear Arrangement of Turán Graphs
Arul Jeya Shalini1, J. Nancy Delaila2, J. Maria Julie3

1Arul Jeya Shalini, Department of Mathematics, Women’s Christian College, Chennai, India.
2J. Nancy Delaila*, Department of Mathematics, Loyola College, University of Madras, Chennai, India.
3J. Maria Julie, Department of Mathematics, Government Arts College, Paramakudi, India.
Manuscript received on March 12, 2020. | Revised Manuscript received on March 25, 2020. | Manuscript published on March 30, 2020. | PP: 3618-3621 | Volume-8 Issue-6, March 2020. | Retrieval Number: F8964038620/2020©BEIESP | DOI: 10.35940/ijrte.F8964.038620

Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Graph embedding in parallel processing techniques has acquired considerable attention and hence raised as an efficient approach for reducing overhead data into low-dimensional space. Optimal layout and congestion are powerful parameters to examine the capability of embedding. In this study, Modified Congestion and  -Partition lemmas are utilized to obtain the optimal layout of Turán graph into path and windmill graphs.
Keywords: Embedding, Congestion, Turán graph, Layout.
Scope of the Article: Graph Algorithms And Graph Drawing.