Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 3 of 3
Full-Text Articles in Other Mathematics
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 …
Neighborhood-Restricted Achromatic Colorings Of Graphs, James D. Chandler Sr.
Neighborhood-Restricted Achromatic Colorings Of Graphs, James D. Chandler Sr.
Electronic Theses and Dissertations
A (closed) neighborhood-restricted 2-achromatic-coloring of a graph G is an assignment of colors to the vertices of G such that no more than two colors are assigned in any closed neighborhood. In other words, for every vertex v in G, the vertex v and its neighbors are in at most two different color classes. The 2-achromatic number is defined as the maximum number of colors in any 2-achromatic-coloring of G. We study the 2-achromatic number. In particular, we improve a known upper bound and characterize the extremal graphs for some other known bounds.
The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon
The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon
Theses and Dissertations
An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if …