Geodesic
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
Journal of Graph Algorithms and Applications, Tome 25 (2021) no. 1, pp. 367-381.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

The wirelength is one of the key parameters of the quality of embedding graphs into host graphs. To our knowledge, no results for computing the wirelength of embedding irregular graphs into irregular graphs are known in the literature. We develop an algorithm that determines the wirelength of embedding of the Turán graph $T(\ell, 2^p)$, where $2^{n-1} \leq \ell 2^{n}$ and $1\le p\le \lceil \log_2 \ell\rceil\leq n$, into the incomplete hypercube $I^{\ell}_{n}$. Incomplete hypercubes form an important generalization of hypercubes because they eliminate the restriction on the number of nodes in a system. 
@article{JGAA_2021_25_1_a15,
     author = {A. Arul Shantrinal and Sandi Klav\v{z}ar and T.M. Rajalaxmi and R. Sundara Rajan},
     title = {An algorithm for embedding {Tur\'an} graphs into incomplete hypercubes with minimum wirelength},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {367--381},
     publisher = {mathdoc},
     volume = {25},
     number = {1},
     year = {2021},
     doi = {10.7155/jgaa.00562},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00562/}
}
TY  - JOUR
AU  - A. Arul Shantrinal
AU  - Sandi Klavžar
AU  - T.M. Rajalaxmi
AU  - R. Sundara Rajan
TI  - An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
JO  - Journal of Graph Algorithms and Applications
PY  - 2021
SP  - 367
EP  - 381
VL  - 25
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00562/
DO  - 10.7155/jgaa.00562
LA  - en
ID  - JGAA_2021_25_1_a15
ER  - 
%0 Journal Article
%A A. Arul Shantrinal
%A Sandi Klavžar
%A T.M. Rajalaxmi
%A R. Sundara Rajan
%T An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
%J Journal of Graph Algorithms and Applications
%D 2021
%P 367-381
%V 25
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00562/
%R 10.7155/jgaa.00562
%G en
%F JGAA_2021_25_1_a15
A. Arul Shantrinal; Sandi Klavžar; T.M. Rajalaxmi; R. Sundara Rajan. An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. Journal of Graph Algorithms and Applications, Tome 25 (2021) no. 1, pp. 367-381. doi : 10.7155/jgaa.00562. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00562/

Cité par Sources :