## Search

Now showing items 1-5 of 5

#### Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)

Our work continues a long tradition in graph theory studying the relation-
ship between vertex connectivity, edge connectivity, and minimum degree. [From Introduction]

#### Steinhaus graphs and pendent vertices (thesis)

Steinhaus graphs have many interesting properties, yet there are many things about them that are not
yet known. In [1], a formula was discovered for the total number of Steinhaus graphs on 11 vertices with at
least one ...

#### Finding Cycles In The Kth Power Diagraphs Over Integers Modulo A Prime And Over Gaussian Integers Modulo a Gaussian Prime (thesis)

Given Zp where p is an integer prime, let's de ne G(k) p to be the digraph whose set of vertices is Zp such that there is a directed edge from a vertex a to a vertex b if ak b mod p. First, we nd our own way to decide ...

#### Realizability of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree (thesis)

This is the fourth and nal
thesis that concludes ProfessorWayne M. Dymacek's research project Realizability
of n-Vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity,
Minimum Degree, and Maximum Degree. ...