Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Mathematics (3)
- Computer Sciences (3)
- Discrete Mathematics and Combinatorics (3)
- Artificial Intelligence and Robotics (2)
- Other Applied Mathematics (2)
-
- Aerospace Engineering (1)
- Algebra (1)
- Algebraic Geometry (1)
- Applied Statistics (1)
- Data Science (1)
- Disease Modeling (1)
- Diseases (1)
- Electrical and Computer Engineering (1)
- Engineering (1)
- Geometry and Topology (1)
- Medicine and Health Sciences (1)
- Number Theory (1)
- Numerical Analysis and Computation (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Other Aerospace Engineering (1)
- Special Functions (1)
- Statistical Models (1)
- Statistics and Probability (1)
- Systems Engineering (1)
- Systems Engineering and Multidisciplinary Design Optimization (1)
- Systems and Communications (1)
- Theory and Algorithms (1)
- Institution
- Publication
- Publication Type
Articles 1 - 12 of 12
Full-Text Articles in Other Mathematics
Leveraging Information Theory And Ecological Network Analysis To Monitor Communication Networks In A Student Aerospace Team, Christine Sessions
Leveraging Information Theory And Ecological Network Analysis To Monitor Communication Networks In A Student Aerospace Team, Christine Sessions
Doctoral Dissertations and Master's Theses
Effective communication is a critical component of successful collaboration in group projects and team settings. However, systematically tracking and analyzing team communications can be challenging, especially in complex, multi-member teams such as those found in the aerospace industry. This paper explores an information-theoretic approach that leverages encoding techniques and graph theory to analyze communication networks within a university’s multi-year, student-led cubesat design project (Project COMET). By utilizing Shannon Entropy as a measure of information flow, encoding communication patterns, and analyzing Ecological Network Analysis parameters, this research aims to understand how an Embry-Riddle Aeronautical University student project team evolves over the …
Constructing Binary Encoding Matrices From Joined Graphs, Joshua Avalos
Constructing Binary Encoding Matrices From Joined Graphs, Joshua Avalos
Electronic Theses, Projects, and Dissertations
Codes and technology are part of our daily lives and allow the modern world to function, and for us to have conveniences in our lives such as smartphones that can be used to privately call people on the other side of the planet, and for secure access to the internet. In this thesis we will explore the construction of binary codes created by vertex-edge incidence matrices of planar graphs. The Hamming (7,4) code was an incredible code that allowed the detection and correction of errors after receiving them through a transmission. We will explore the possibility of the creation of …
Strong Neighborhood-Prime Labelings Under Ordinary & Gaussian Integers, Micheal Arnal-Brown
Strong Neighborhood-Prime Labelings Under Ordinary & Gaussian Integers, Micheal Arnal-Brown
Murray State Theses and Dissertations
This thesis introduces and studies the notion of a strong neighborhood-prime labeling, a strengthening of the neighborhood-prime labeling where the label 1 can be assigned to any vertex in a graph. We prove that several graph families—including paths, cycles (excluding those congruent to 2 modulo 4), caterpillars, helm graphs, closed helm graphs, gear graphs, and graphs with universal vertices—admit such labelings, and also provide results to more general classes of graphs. We extend this new labeling concept to the Gaussian integers using a spiral order- ing on Z[i] and define a Gaussian analogue of strongly neighborhood-primeness. To support this extension, …
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 Math Without Words Puzzle, Jane H. Long, Clint Richardson
A Math Without Words Puzzle, Jane H. Long, Clint Richardson
Journal of Math Circles
A visual puzzle by James Tanton forms the basis for a session that has been successfully implemented with various audiences. Designed to be presented with no directions or description, the puzzle requires participants to discover the goals themselves and to generate their own questions for investigation. Solutions, significant facilitation suggestions, and possibilities for deep mathematical extensions are discussed; extensive illustrations are included.
Modeling The Spread Of Covid-19 Over Varied Contact Networks, Ryan L. Solorzano
Modeling The Spread Of Covid-19 Over Varied Contact Networks, Ryan L. Solorzano
Master's Theses
When attempting to mitigate the spread of an epidemic without the use of a vaccine, many measures may be made to dampen the spread of the disease such as physically distancing and wearing masks. The implementation of an effective test and quarantine strategy on a population has the potential to make a large impact on the spread of the disease as well. Testing and quarantining strategies become difficult when a portion of the population are asymptomatic spreaders of the disease. Additionally, a study has shown that randomly testing a portion of a population for asymptomatic individuals makes a small impact …
Grim Under A Compensation Variant, Aaron Davis, Aaron Davis
Grim Under A Compensation Variant, Aaron Davis, Aaron Davis
Honors College Theses
Games on graphs are a well studied subset of combinatorial games. Balance and strategies for winning are often looked at in these games. One such combinatorial graph game is Grim. Many of the winning strategies of Grim are already known. We note that many of these winning strategies are only available to the first player. Hoping to develop a fairer Grim, we look at Grim played under a slighlty different rule set. We develop winning strategies and known outcomes for this altered Grim. Throughout, we discuss whether our altered Grim is a fairer game then the original.
Decompositions Of The Complete Mixed Graph By Mixed Stars, Chance Culver
Decompositions Of The Complete Mixed Graph By Mixed Stars, Chance Culver
Electronic Theses and Dissertations
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions …
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler
Senior Independent Study Theses
Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Phylogenetic Networks And Functions That Relate Them, Drew Scalzo
Williams Honors College, Honors Research Projects
Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate …
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson
Murray State Theses and Dissertations
We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …
Radio Number For Fourth Power Paths, Linda V. Alegria
Radio Number For Fourth Power Paths, Linda V. Alegria
Electronic Theses, Projects, and Dissertations
A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each …