Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- ETD (2)
- Combinatorial game theory (1)
- Combinatorics (1)
- Cystic fibrosis (1)
- Dense tree (1)
-
- Distance-2 Domatic Number (1)
- Distance-2 Domination (1)
- Distances between leaves (1)
- Domatic Number (1)
- Domination (1)
- Domineering (1)
- Edge-swap heuristic (1)
- Graph theory (1)
- Graph-theoretic Models (1)
- Graphs (1)
- Hackenbush (1)
- Hanoi variant (1)
- Havel hakimi (1)
- Isomorphism (1)
- Leech tree (1)
- Minimum spanning tree (1)
- Modular Leech tree (1)
- Molecular Descriptors (1)
- Mutation (1)
- NBD2 (1)
- Nested Graph. (1)
- Puzzle (1)
- Rainbow (1)
- Tower of Hanoi (1)
- Tree topplers (1)
Articles 1 - 6 of 6
Full-Text Articles in Mathematics
Distance-2 Domatic Numbers Of Graphs, Derek Kiser
Distance-2 Domatic Numbers Of Graphs, Derek Kiser
Electronic Theses and Dissertations
The distance d(u, v) between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is called a distance-2 dominating set if every vertex in V \S is within distance-2 of at least one vertex in S. The distance-2 domatic number is the maximum number of sets in a partition of the vertices of G into distance-2 dominating sets. We give bounds on the distance-2 domatic number of a graph and determine the distance-2 domatic number of selected classes of graphs.
The Apprentices' Tower Of Hanoi, Cory Bh Ball
The Apprentices' Tower Of Hanoi, Cory Bh Ball
Electronic Theses and Dissertations
The Apprentices' Tower of Hanoi is introduced in this thesis. Several bounds are found in regards to optimal algorithms which solve the puzzle. Graph theoretic properties of the associated state graphs are explored. A brief summary of other Tower of Hanoi variants is also presented.
A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba
A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba
Electronic Theses and Dissertations
One of the most prevalent inherited diseases is cystic fibrosis. This disease is caused by a mutation in a membrane protein, the cystic fibrosis transmembrane conductance regulator (CFTR). CFTR is known to function as a chloride channel that regulates the viscosity of mucus that lines the ducts of a number of organs. Generally, most of the prevalent mutations of CFTR are located in one of two nucleotide binding domains, namely, the nucleotide binding domain 1 (NBD1). However, some mutations in nucleotide binding domain 2 (NBD2) can equally cause cystic fibrosis. In this work, a hierarchical graph is built for NBD2. …
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Electronic Theses and Dissertations
In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type questions on distances between leaves are studied as well as some other labeling questions …
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Electronic Theses and Dissertations
The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.
Graphs Of Classroom Networks, Rebecca Holliday
Graphs Of Classroom Networks, Rebecca Holliday
Electronic Theses and Dissertations
In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …