Sparse ordinary graphs

dc.contributor.author	Kalk, Jonathan W.
dc.date.accessioned	2013-02-06T20:28:18Z
dc.date.available	2013-02-06T20:28:18Z
dc.date.issued	2005
dc.description	vii, 65 leaves, bound ; 29 cm.
dc.description	Thesis (Ph. D.)--University of Hawaii at Manoa, 2005.
dc.description.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.
dc.format.extent	vii, 65 leaves
dc.identifier.uri	http://hdl.handle.net/10125/25937
dc.language	en-US
dc.publisher	University of Hawaii at Manoa
dc.relation	Theses for the degree of Doctor of Philosophy (University of Hawaii at Manoa). Mathematics ; no. 4672
dc.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.
dc.subject	Graphic methods.
dc.title	Sparse ordinary graphs
dc.type	Thesis
dc.type.dcmi	Text
local.identifier.callnumber	AC1 .H3 no.4672
local.thesis.degreelevel	PhD
local.thesis.department	Mathematics

Files

Now showing 1 - 2 of 2