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.

No description available.

Thesis (Ph. D.)--Columbia University, 1937. / Vita. "Reprinted from Osiris (vol. III, part I), November 1937." Cover title. "Annotated bibliography": p. 374-394.

Thesis--University of Florida. / Description based on print version record. Typescript. Vita. Includes bibliographical references (leaves 91-92).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1959. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 154-158).

Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar if and only if it has no subgraph homeomorphic to K₅ or K₃,₃. It has remained as a direct criterion for determining whether a graph is planar or not. Powerful as the theorem is, it is not always easy to apply. This leads us to try some practical methods to test a planar graph. In this thesis, we have an algorithm for finding an outer circuit for a simple connected planar graph. Then, we use this outer circuit to draw a straight line graph in the plane. The programme for this algorithm is written in FORTRAN for an IBM 360/67 Computer. / Science, Faculty of / Computer Science, Department of / Graduate

A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs. For planar graphs this problem has been algorithmically solved: that is, there is an algorithm which takes a n vertex planar graph and places the vertices at some of the nodes of an n-2 by 2n-4 array so that each edge of the planar graph can be drawn with a straight line. We describe in detail one particular implementation of this algorithm, give some examples in which this embedding is pleasing, and give a number of examples in which this grid embedding is not as visually pleasing another drawing of the same graph. For the more difficult problem of drawing a nonplanar graph, we investigate a spring based algorithm. We give a number of examples in which this heuristic produces more pleasing drawings than those produced by the planar embedding and a few cases where it fails to do so. / Graduation date: 1997

Thesis (M.S.) in Teaching--University of Maine, 2009. / Includes vita. Includes bibliographical references (leaves 76-80).

No description available.

No description available.