Embedding the incomplete hypercube in books

Embedding Sun Graphs in a Single Page

“…The book embeddings have been studied for many classes of graphs. To name a few, we have: Complete Graphs [1,2], Complete Bipartite Graphs [10], Trees, Grids and X-trees [3], hypercubes [3,9], incomplete hypercubes [8], iterated line digraphs [6], de Bruijn graphs, Kautz graphs, shuffle-exchange graphs [7], for each of which embedding in books have been studied.…”

An Embedding Algorithm for a Specialcase of Extended Grids

“…The book embeddings have been studied for many classes of graphs. To name a few, we have: Complete Graphs [1,2], Complete Bipartite Graphs [10], Trees, Grids and X-trees [3], hypercubes [3,9], incomplete hypercubes [8], iterated line digraphs [6], de Bruijn graphs, Kautz graphs, shuffle-exchange graphs [7], for each of which embedding in books have been studied.…”

A Less Complex Algorithmic Procedure for Computing Gray Codes

“…Some of them are mentioned here as follows. However, more can be learned through the references pro vided as in the references (Sundberg, 1975;Ludman, 1981;Er, 1984, andProskurowski andRuskey, 1985; _____________________________________ *Corresponding author's e-mail: afaq@squ.edu.om Lee, 1986;Conway, et al 1989;Skiena, 1990;Press, et al 1992;Etzion and Peterson, 1992;Hiltgen, et al 1996;Savage, 1997;Ruskey, 1997;Guan andDah-Jyu, 1998, Moshe andTuvi, 1999;Black Paul 2004;Alan and Alessandro Mei, 2004;Jywe-Fei and Lai, 2005;Bitner, et al 2005).…”

“…Since the Gray code has enormous applications as mentioned above has many facet researches as is evident in surveying the literature (Gray, 1953;Sundberg, 1975;Ludman, 1981;Lee, 1986;Conway, et al 1989;Skiena, 1990;Press, et al 1992;Etzion Peterson, 1992;Hiltgen, et al 1996;Savage, 1997;Ruskey, 1997;Guan Dah-Jyu, 1998, Moshe andTuvi, 1999;Black Paul 2004;Alan and Alessandro Mei, 2004;Jywe-Fei and Lai, 2005;Bitner, et al 1976;Er, 1984;Proskurowski and Ruskey, 1985;Ruskey, 1993;Dominique, 2000;Lassing, et al 2003, Goddyn and Gvozdjak 2003and Vajnovszki and Walsh 2006. It is clear through the literature survey that there had been much discovered and written about the Gray code; it is associated with many elegant circuits and algorithms.…”