Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Balance (1)
- Bipartite graphs. (1)
- DNA (1)
- Euclidean Buildings (1)
- Free Groups (1)
-
- Frustration index (1)
- Frustration number (1)
- Geometric Group Theory (1)
- Graph Theory (1)
- Latin squares (1)
- Maximum frustration (1)
- Minimum embeddings (1)
- Optimal pots (1)
- Ryser's Theorem (1)
- Self-assembly (1)
- Sign-symmetric. (1)
- Signed graph (1)
- Strong Schottky Lemma (1)
- Switching (1)
- Switching isomorphism (1)
- Trapezohedral Graphs (1)
Articles 1 - 4 of 4
Full-Text Articles in Discrete Mathematics and Combinatorics
Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri
Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri
Theses and Dissertations
In this dissertation, we investigate various aspects of signed graphs, with a particular focus on signings and sign-symmetric signed graphs. We begin by examining the complete graph on six vertices with one edge deleted ($K_6$\textbackslash e) and explore the different ways of signing this graph up to switching isomorphism. We determine the frustration index (number) of these signings and investigate the existence of sign-symmetric signed graphs. We then extend our study to the $K_6$\textbackslash 2e graph and the McGee graph with exactly two negative edges. We investigate the distinct ways of signing these graphs up to switching isomorphism and demonstrate …
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Electronic Theses, Projects, and Dissertations
Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …
A Stronger Strong Schottky Lemma For Euclidean Buildings, Michael E. Ferguson
A Stronger Strong Schottky Lemma For Euclidean Buildings, Michael E. Ferguson
Dissertations, Theses, and Capstone Projects
We provide a criterion for two hyperbolic isometries of a Euclidean building to generate a free group of rank two. In particular, we extend the application of a Strong Schottky Lemma to buildings given by Alperin, Farb and Noskov. We then use this extension to obtain an infinite family of matrices that generate a free group of rank two. In doing so, we also introduce an algorithm that terminates in finite time if the lemma is applicable for pairs of certain kinds of matrices acting on the Euclidean building for the special linear group over certain discretely valued fields.
Partially Filled Latin Squares, Mariam Abu-Adas
Partially Filled Latin Squares, Mariam Abu-Adas
Scripps Senior Theses
In this thesis, we analyze various types of Latin squares, their solvability and embeddings. We examine the results by M. Hall, P. Hall, Ryser and Evans first, and apply our understandings to develop an algorithm that the determines the minimum possible embedding of an unsolvable Latin square. We also study Latin squares with missing diagonals in detail.