Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 13 of 13
Full-Text Articles in Entire DC Network
Tutte-Equivalent Matroids, Maria Margarita Rocha
Tutte-Equivalent Matroids, Maria Margarita Rocha
Electronic Theses, Projects, and Dissertations
We begin by introducing matroids in the context of finite collections of vectors from a vector space over a specified field, where the notion of independence is linear independence. Then we will introduce the concept of a matroid invariant. Specifically, we will look at the Tutte polynomial, which is a well-defined two-variable invariant that can be used to determine differences and similarities between a collection of given matroids. The Tutte polynomial can tell us certain properties of a given matroid (such as the number of bases, independent sets, etc.) without the need to manually solve for them. Although the Tutte …
Realizing Tournaments As Models For K-Majority Voting, Gina Marie Cheney
Realizing Tournaments As Models For K-Majority Voting, Gina Marie Cheney
Electronic Theses, Projects, and Dissertations
A k-majority tournament is a directed graph that models a k-majority voting scenario, which is realized by 2k - 1 rankings, called linear orderings, of the vertices in the tournament. Every k-majority voting scenario can be modeled by a tournament, but not every tournament is a model for a k-majority voting scenario. In this thesis we show that all acyclic tournaments can be realized as 2-majority tournaments. Further, we develop methods to realize certain quadratic residue tournaments as k-majority tournaments. Thus, each tournament within these classes of tournaments is a model for a k …
Whitney's 2-Isomorphism Theorem For Hypergraphs, Eric Anthony Taylor
Whitney's 2-Isomorphism Theorem For Hypergraphs, Eric Anthony Taylor
Theses Digitization Project
This study will examine a fundamental theorem from graph theory: Whitney's 2-Isomorphism Theorem. Whitney's 2-Isomorphism theorem characterizes when two graphs have isomorphic cycle matroids.
The Fibonacci Sequence And Hosoya's Triangle, Jeffrey Lee Smith
The Fibonacci Sequence And Hosoya's Triangle, Jeffrey Lee Smith
Theses Digitization Project
The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci numbers.
A Study Of Finite Symmetrical Groups, Patrick Kevin Martinez
A Study Of Finite Symmetrical Groups, Patrick Kevin Martinez
Theses Digitization Project
This study discovered several important groups that involve the classical and sporadic groups. These groups appeared as finite homomorphic images of the progenitors 3*8 : PGL₂(7), 2*¹⁴ : L₃ (2), 5*³ : S₃ and 7*2 : m S₃.
Prouhet-Tarry-Escott Problem, Juan Manuel Gutierrez
Prouhet-Tarry-Escott Problem, Juan Manuel Gutierrez
Theses Digitization Project
The purpose of this research paper is to gain a deeper understanding of a famous unsolved mathematical problem known as the Prouhet-Terry-Escott Problem. The Prouhet-Terry-Escott Problem is a complex problem that still has much to be discovered. This fascinating problem shows up in many areas of mathematics such as the study of polynomials, graph theory, and the theory of integral quadratic forms.
Snort: A Combinatorial Game, Keiko Kakihara
Snort: A Combinatorial Game, Keiko Kakihara
Theses Digitization Project
This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we examine graphs that result in a first player win.
Tutte Polynomial In Knot Theory, David Alan Petersen
Tutte Polynomial In Knot Theory, David Alan Petersen
Theses Digitization Project
This thesis reviews the history of knot theory with an emphasis on the diagrammatic approach to studying knots. Also covered are the basic concepts and notions of graph theory and how these two fields are related with an example of a knot diagram and how to associate it to a graph.
Investigation Of 4-Cutwidth Critical Graphs, Dolores Chavez
Investigation Of 4-Cutwidth Critical Graphs, Dolores Chavez
Theses Digitization Project
A 2004 article written by Yixun Lin and Aifeng Yang published in the journal Discrete Math characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.
Various Steiner Systems, Valentin Jean Racataian
Various Steiner Systems, Valentin Jean Racataian
Theses Digitization Project
This project deals with the automorphism group G of a Steiner system S (3, 4, 10). S₁₀, the symmetrical group of degree 10, acts transitively on T, the set of all Steiner systems with parameters 3, 4, 10. The purpose of this project is to study the action of S₁₀ on cosets of G. This will be achieved by means of a graph of S₁₀ on T x T. The orbits of S₁₀ on T x T are in one-one correspondence with the orbits of G, the stabilizer of an S [e] T on T.
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
Theses Digitization Project
Algorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.
The Edge-Isoperimetric Problem For The Square Tessellation Of Plane, Sunmi Lee
The Edge-Isoperimetric Problem For The Square Tessellation Of Plane, Sunmi Lee
Theses Digitization Project
The solution for the edge-isoperimetric problem (EIP) of the square tessellation of plane is investigated and solved. Summaries of the stabilization theory and previous research dealing with the EIP are stated. These techniques enable us to solve the EIP of the cubical tessellation.
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Theses Digitization Project
Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.