Optimal Linear Arrangement of Turán Graphs | Zendy

Arul Jeya Shalini | Zendy; J. Nancy Delaila | Zendy; J. Maria Julie | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimal Linear Arrangement of Turán Graphs

Author(s) -

Arul Jeya Shalini,

J. Nancy Delaila,

J. Maria Julie

Publication year - 2020

Publication title -

international journal of recent technology and engineering (ijrte)

Language(s) - English

Resource type - Journals

ISSN - 2277-3878

DOI - 10.35940/ijrte.f8964.038620

Subject(s) - embedding , computer science , partition (number theory) , graph , overhead (engineering) , book embedding , pathwidth , theoretical computer science , mathematics , combinatorics , line graph , artificial intelligence , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research