DocumentCode
2340002
Title
The genus of the complete multipartite graph and the complete multi-layered graph
Author
Bettayeb, Saïd ; Nguyen, Quan T.
Author_Institution
Sch. of Sci. & Comput. Eng., Univ. of Houston Clear Lake, Houston, TX, USA
fYear
2010
fDate
16-19 May 2010
Firstpage
1
Lastpage
4
Abstract
The 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 layouts.
Keywords
graph theory; bipartite graph; complete multilayered graph; complete multipartite graph; computer network; Artificial neural networks; Bipartite graph; Layout; Mirrors; Multiprocessor interconnection; Program processors; Upper bound; embedding; genus; girth; multilayered graph; multipartite graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on
Conference_Location
Hammamet
Print_ISBN
978-1-4244-7716-6
Type
conf
DOI
10.1109/AICCSA.2010.5587024
Filename
5587024
Link To Document