The hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying properties of graphs. An MS WINDOWS based graphical system is developed which allows the creation and display of graphs and their spanning graphs, line graphs and super line graphs. / Department of Computer Science
| Identifer | oai:union.ndltd.org:BSU/oai:cardinalscholar.bsu.edu:handle/184633 |
| Date | January 1993 |
| Creators | Li, Mingrui |
| Contributors | Ball State University. Dept. of Computer Science., Bagga, Kunwarjay S. |
| Source Sets | Ball State University |
| Detected Language | English |
| Format | i, 106 leaves : ill. ; 28 cm. |
| Source | Virtual Press |
Page generated in 0.0018 seconds