Browsing by Subject "Graph theory"
Now showing items 1-9 of 9
-
Effectiveness of Genetic Algorithms in Finding Steinhaus Graphs with Maximal Clique Size
The goal of this research was to study the effectiveness of genetic algorithms (GA) in finding Steinhaus graphs of a given size whose maximal cliques were as large as possible. This investigation was based on the results ... -
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 ... -
Procedural Generation of Metroidvania Style Levels (thesis)
Video game maps can become dull with repeated play-throughs and handcrafting a variety of maps can be a tedious and time consuming process. This is especially true for games of the Metroidvania genre, games which focus on ... -
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] -
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. ... -
Steinhaus Graph Connectivity: Initial Data and Analysis (thesis)
The goal of this thesis is to obtain and analyze data on the connectivity of Steinhaus graphs. -
Steinhaus Graphs and Pendent Vertices
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 n vertices with at least one ... -
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 ...