The Genus of Complete Multipartite Graphs and Complete Multi- Layered Graphs

Simple item page
dc.contributor.authorBettayeb, Said
dc.date.accessioned2020-05-11T18:11:19Z
dc.date.available2020-05-11T18:11:19Z
dc.date.issued2010
dc.description.abstractThe complete multipartite graph and the complete multi-layered graph are both generalizations of the complete bipartite graph. These two kinds of graphs have recursive structure and offer a very flexible choice of network size with respect to a fixed network order. This paper addresses the genus of the complete multipartite graph and the complete multi-layered graph which measures how efficiently we can set up a computer network using these graph layoutsen_US
dc.identifier.citationThe Genus of Complete Multipartite Graphs and Complete Multi-Layered Graphs, (with Q. Nguyen), Proc. of the 2010 ACS/IEEE International Conference on Computer Systems and Applications, May16-19, 2010 in Hammamet, Tunisiaen_US
dc.identifier.urihttps://hdl.handle.net/10657.1/2330
dc.publisherACS/IEEE International Conference on Computer Systems and Applicationsen_US
dc.subjectgenus, girth, multipartite graph, multilayered graph, embeddingen_US
dc.titleThe Genus of Complete Multipartite Graphs and Complete Multi- Layered Graphsen_US
dc.typePresentationen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
The Genus of Complete Mulipartite of Graphs and Complete Multi-Layered Graphs.pdf
Size:
7.4 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

College of Science and Engineering
Said Bettayeb