Please use this identifier to cite or link to this item:
Sparse ordinary graphs
|PhD_2005_Kalk_uh.pdf||Version for UH users||351.96 kB||Adobe PDF||View/Open|
|PhD_2005_Kalk_r.pdf||Version for non-UH users. Copying/Printing is not permitted||355.72 kB||Adobe PDF||View/Open|
|Title:||Sparse ordinary graphs|
|Authors:||Kalk, Jonathan W.|
|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  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
Please email email@example.com if you need this content in ADA-compliant format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.