Return to search

Sparse ordinary graphs

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. / vii, 65 leaves, bound ; 29 cm. / Thesis (Ph. D.)--University of Hawaii at Manoa, 2005.

Identiferoai:union.ndltd.org:UHAWAII/oai:scholarspace.manoa.hawaii.edu:10125/25937
Date January 2005
CreatorsKalk, Jonathan W.
PublisherUniversity of Hawaii at Manoa
Source SetsUniversity of Hawaii at Manoa Libraries
Languageen-US
Detected LanguageEnglish
TypeThesis, Text
Formatvii, 65 leaves
RightsAll 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.

Page generated in 0.0018 seconds