Please use this identifier to cite or link to this item:

Sparse ordinary graphs

File Description SizeFormat 
PhD_2005_Kalk_uh.pdfVersion for UH users351.96 kBAdobe PDFView/Open
PhD_2005_Kalk_r.pdfVersion for non-UH users. Copying/Printing is not permitted355.72 kBAdobe PDFView/Open

Item Summary

Title: Sparse ordinary graphs
Authors: Kalk, Jonathan W.
Keywords: Graphic methods.
Issue Date: 2005
Publisher: University of Hawaii at Manoa
Abstract: Ordinary graphs are directed graphs that can be viewed as generalizations of symmetric block designs. They were introduced by Fossorier, Jezek, Nation and Pogel in [2] in an attempt to construct new finite projective planes. In this thesis we investigate some special cases of ordinary graphs, most prominently the case where nonadjacent vertices have no common neighbors. We determine all connected graphs of this type that exist.
Description: vii, 65 leaves, bound ; 29 cm.
Thesis (Ph. D.)--University of Hawaii at Manoa, 2005.
Pages/Duration: vii, 65 leaves
Rights: All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
Appears in Collections:Ph.D. - Mathematics
Ph.D. Dissertations- Mathematics Department

Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.