The following is a study of the problem of computer generation of non-isomorphic regular graphs of degree d on n points. The uork consists of a study of various properties and representations of regular graphs and a discussion of hov these might be useful in solving the isomorphism problem in the computer generation of regular graphs. An algorithm for the generation of regular graphs of degree 3 on n points with a Hamiltonian cycle is presented. The algorithm is not ideal in that it does not generate distinct (ie. non-isomorphic) copies, and so a procedure for detecting graph isomorphism is used to process the list of graphs produced by the algorithm. / Science, Faculty of / Computer Science, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/18690 |
| Date | January 1974 |
| Creators | Bowman, Diane M. |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0024 seconds