Show simple item record

dc.contributor.authorBettayeb, Said
dc.date.accessioned2020-05-11T18:21:42Z
dc.date.available2020-05-11T18:21:42Z
dc.date.issued2011
dc.identifier.citationOn the Genus of the Pancake Network, (with Quan Nguyen), the International Journal of Information Technology Vol. 8, No. 3 July 2011. http://www.ccis2k.org/iajit/PDF/vol.8,no.3/1247.pdfen_US
dc.identifier.urihttps://hdl.handle.net/10657.1/2334
dc.description.abstractBoth the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus on another important property, namely the genus. The genus of a graph is the minimum number of handles needed for drawing the graph on the plane without edges crossing. We will investigate the upper bound and lower bound for the genus of pancake graph and compare these values with the genus of the star graph as well as that of the hypercube.en_US
dc.publisherThe International Journal of Information Technologyen_US
dc.subjectGenus, binary hypercube, permutation, pancake network, Cayley graph, and prefix reversal.en_US
dc.titleOn the Genus of Pancake Networken_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record