## Search

Now showing items 1-10 of 14

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

(2014)

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)

(2015)

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

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

(2016)

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. ...

#### Arithmetic progressions in permutations (thesis)

(2011)

In this thesis we will examine progressions in permutations. We will analyze regular and circular permutations with progressions either modular or regular with rise one or two. We will calculate the number of permutations ...

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

(2010)

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 ...

#### Permutation Formula (thesis)

(2014)

Runs in permutations and similar topics have been studied by various authors under different names. Hegarty examined permutations of finite abelian groups which avoid what he called progressions. Riordan studied 3-runs ...

#### Periods of Linearly Recurring Sequences (thesis)

(2015)

In this thesis, we investigate sequences defined by linear recurrence relations. These are sequences whose subsequent terms are generated using some linear combination of the previous terms. We call the equation that ...