Digital Commons Network^™

Rearrangement Operations On Unrooted Phylogenetic Networks, Remie Janssen, Jonathan Klawitter

Theory and Applications of Graphs

Rearrangement operations transform a phylogenetic tree into another one and hence induce a metric on the space of phylogenetic trees. Popular operations for unrooted phylogenetic trees are NNI (nearest neighbour interchange), SPR (subtree prune and regraft), and TBR (tree bisection and reconnection). Recently, these operations have been extended to unrooted phylogenetic networks, which are generalisations of phylogenetic trees that can model reticulated evolutionary relationships. Here, we study global and local properties of spaces of phylogenetic networks under these three operations. In particular, we prove connectedness and asymptotic bounds on the diameters of spaces of different classes of phylogenetic networks, including …

Conditional Strong Matching Preclusion Of The Alternating Group Graph, Mohamad Abdallah, Eddie Cheng

Theory and Applications of Graphs

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AG_n.

Forcibly-Biconnected Graphical Degree Sequences: Decision Algorithms And Enumerative Results, Kai Wang

Theory and Applications of Graphs

We present an algorithm to test whether a given graphical degree sequence is forcibly biconnected. The worst case time complexity of the algorithm is shown to be exponential but it is still much better than the previous basic algorithm for this problem. We show through experimental evaluations that the algorithm is efficient on average. We also adapt the classic algorithm of Ruskey et al. and that of Barnes and Savage to obtain some enumerative results about forcibly biconnected graphical degree sequences of given length n and forcibly biconnected graphical partitions of given even integer n. Based on these enumerative …

Laplacian Spectral Characterization Of Signed Sun Graphs, Fatemeh Motialah, Mohammad Hassan Shirdareh Haghighi

Theory and Applications of Graphs

A sun SG_n is a graph of order 2n consisting of a cycle C_n, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra. Also we show that a balanced signed sun graph is determined by its Laplacian spectrum if and only if n is odd.

Fractional Strong Matching Preclusion For Two Variants Of Hypercubes, Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao

Theory and Applications of Graphs

Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.

Colored Complete Hypergraphs Containing No Rainbow Berge Triangles, Colton Magnant

Theory and Applications of Graphs

The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers. In this work, we extend the main structural tool from rainbow triangle free colorings of complete graphs to rainbow Berge triangle free colorings of hypergraphs. In doing so, some other concepts and results are also translated from graphs to hypergraphs.

Exploration Using Without-Replacement Sampling Of Actions Is Sometimes Inferior, Stephen W. Carden, S. Dalton Walker

Department of Mathematical Sciences Faculty Publications

In many statistical and machine learning applications, without-replacement sampling is considered superior to with-replacement sampling. In some cases, this has been proven, and in others the heuristic is so intuitively attractive that it is taken for granted. In reinforcement learning, many count-based exploration strategies are justified by reliance on the aforementioned heuristic. This paper will detail the non-intuitive discovery that when measuring the goodness of an exploration strategy by the stochastic shortest path to a goal state, there is a class of processes for which an action selection strategy based on without-replacement sampling of actions can be worse than with-replacement …

Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper

Theory and Applications of Graphs

The maximum oriented k-forcing number of a simple graph G, written MOF_k(G), is the maximum directed k-forcing number among all orientations of G. This invariant was recently introduced by Caro, Davila and Pepper in [6], and in the current paper we study the special case where G is the complete graph with order n, denoted K_n . While MOF_k(G) is an invariant for the underlying simple graph G, MOF_k(K_n) can also be interpreted as an interesting property for tournaments. Our main results …

Matching Preclusion Of The Generalized Petersen Graph, Ajay Arora, Eddie Cheng, Christopher Melekian

Theory and Applications of Graphs

The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings. In this paper we determine the matching preclusion number for the generalized Petersen graph P(n,k) and classify the optimal sets.

Series-Parallel Operations With Alpha-Graphs, Christian Barrientos, Sarah Minion

Theory and Applications of Graphs

Among difference vertex labelings of graphs, α-labelings are the most restrictive one. A graph is an α-graph if it admits an α-labeling. In this work, we study a new alternative to construct α-graphs using, the well-known, series-parallel operations on smaller α-graphs. As an application of the series operation, we show that all members of a subfamily of all trees with maximum degree 4, obtained using vertex amalgamation of copies of the path Ρ₁₁}, are α-graphs. We also show that the one-point union of up to four copies of Κ_n,n is an …

Fractional Matching Preclusion For Butterfly Derived Networks, Xia Wang, Tianlong Ma, Chengfu Ye, Yuzhi Xiao, Fang Wang

Theory and Applications of Graphs

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu [18] recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of G, denoted by fmp(G), is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong matching preclusion number (FSMP number) of G, denoted by fsmp(G), is the minimum number of vertices and edges whose deletion …

Patterns, Symmetries, And Mathematical Structures In The Arts, Sarah C. Deloach

Honors College Theses

Mathematics is a discipline of academia that can be found everywhere in the world around us. Mathematicians and scientists are not the only people who need to be proficient in numbers. Those involved in social sciences and even the arts can benefit from a background in math. In fact, connections between mathematics and various forms of art have been discovered since as early as the fourth century BC. In this thesis we will study such connections and related concepts in mathematics, dances, and music.

Singular Ramsey And Turán Numbers, Yair Caro, Zsolt Tuza

Theory and Applications of Graphs

We say that a subgraph F of a graph G is singular if the degrees d_G(v) are all equal or all distinct for the vertices v ∈ V (F). The singular Ramsey number Rs(F) is the smallest positive integer n such that, for every m at least n, in every edge 2-coloring of K_m, at least one of the color classes contains F as a singular subgraph. In a similar flavor, the singular Turán number Ts(n,F) is defined as the maximum number of edges in a graph of order n, …

Cronbach’S Alpha Under Insufficient Effort Responding: An Analytic Approach, Stephen W. Carden, Trevor R. Camper, Nicholas S. Holtzman

Department of Psychology Faculty Publications

Surveys commonly suffer from insufficient effort responding (IER). If not accounted for, IER can cause biases and lead to false conclusions. In particular, Cronbach’s alpha has been empirically observed to either deflate or inflate due to IER. This paper will elucidate how IER impacts Cronbach’s alpha in a variety of situations. Previous results concerning internal consistency under mixture models are extended to obtain a characterization of Cronbach’s alpha in terms of item validities, average variances, and average covariances. The characterization is then applied to contaminating distributions representing various types of IER. The discussion will provide commentary on previous simulation-based investigations, …

An Alternative Approach To The Traditional Internship, Basil M. Conway, David Erikson, Christopher Parrish, Marilyn Strutchens, Jennifer Whitfield

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

This paper reports the benefits and challenges of incorporating a paired-placement model at four different post-secondary teacher preparation programs in secondary mathematics education. The paired-placement model places two secondary mathematics clinical teachers with one mentor (or cooperating) teacher during their internship experience. Benefits exhibited were increased collaboration, more knowledgeable cooperating teachers, increased sense of community, teaming, pedagogical risk-taking, increased reflective practice, established natural professional learning communities, Plan-Do-Study-Act Cycle (PDSA), and increased accountability. Challenges found through the PDSA cycle include personnel issues, number of days teaching, perceived classroom management preparation, preparing university supervisors, mentors, and teacher candidates, and support for collaboration …

Conceptualizing And Interpreting Mean And Median With Future Teachers, Eryn Stehr Maher, Ha Nguyen, Gregory Chamblee, Sharon Taylor

Department of Mathematical Sciences Faculty Publications

Mathematical Education of Teachers II (METII), echoed by the American Statistical Association publication, Statistical Education of Teachers, recommended teacher preparation programs support future teachers in developing deep understandings of mean and median, such that middle grades teachers may use them to “summarize, describe, and compare distributions” (Conference Board of Mathematical Sciences, 2012, p. 44; Franklin et al., 2015). Georgia Standards of Excellence require statistical reasoning from students beginning as early as 6-7 years old, including interpretation of measures of center and statistical reasoning about best measures of center (Georgia Department of Education, 2015). This level of understanding and interpretation of …

Preparing Pre-Service Teachers To Present At A State Conference, Heidi Eisenreich

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

As mathematics teacher educators, we have a responsibility to prepare as many people as we can, to teach mathematics in ways that foster a deeper understanding of the content. We do this by teaching current and future teachers in college programs and providing professional development to in-service teachers. A less explored way is to prepare these “students” to present ideas they have learned to colleagues at their school, other schools in their district, and conferences. In this paper, I share my experience of helping students go through the process of preparing to present over the last two years at our …

Homological Constructions Over A Ring Of Characteristic 2, Michael S. Nelson

Electronic Theses and Dissertations

We study various homological constructions over a ring $R$ of characteristic $2$. We construct chain complexes over a field $K$ of characteristic $2$ using polynomials rings and partial derivatives. We also provide a link from the homology of these chain complexes to the simplicial homology of simplicial complexes. We end by showing how to construct all finitely-generated commutative differential graded $R$-algebras using polynomial rings and partial derivatives.

Inverse Problems Related To The Wiener And Steiner-Wiener Indices, Matthew Gentry

Electronic Theses and Dissertations

In a graph, the generalized distance between multiple vertices is the minimum number of edges in a connected subgraph that contains these vertices. When we consider such distances between all subsets of $k$ vertices and take the sum, it is called the Steiner $k$-Wiener index and has important applications in Chemical Graph Theory. In this thesis we consider the inverse problems related to the Steiner Wiener index, i.e. for what positive integers is there a graph with Steiner Wiener index of that value?

Proceedings Of Thirteenth Annual Meeting Of The Georgia Association Of Mathematics Teacher Educators Front Matter

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

Contents of 13th Annual GAMTE Proceedings Front Matter:

• Officers of GAMTE
• Reviewers
• Copyright & Licensing Terms
• Purposes and Goals of GAMTE
• Conference Schedule
• Dedication
• Table of Contents

K-2 Mathematicians & Writers: Professional Learning Communities For Developing Conceptual Understanding, Doris Santarone, Angel R. Abney, Sandra M. Webb

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

National Council of Teachers of Mathematics (NCTM) has long supported the use of children’s literature, writing, and manipulatives to improve conceptual understanding of mathematics (2000). In a professional learning community for K-2 teachers, professional development was designed and implemented on ways to incorporate literacy and manipulatives into a mathematics lesson. The teachers were charged with collaboratively planning lessons that included multiple components: the standard(s), a mathematics activity, manipulatives, a writing task, and children’s literature. As the data were analyzed, it became apparent that while most of the lessons were well connected, this did not happen for all of the lessons. …

Creative Writing In The Mathematics Classroom, William Lacefield, Laura Markert

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

Creative writing in the mathematics classroom promotes mathematical applications in the real world, constructivist learning, embodied learning, transfer of mathematical ideas, and student engagement. When students are allowed to write about mathematical concepts creatively, they are able to take concepts that they have learned and put them into their world or even create a situation where the mathematical concept applies. Applying mathematical concepts to other environments helps learners transfer mathematical concepts. Learners are able to take the mathematics content and contextualize it outside of the classroom. Writing in mathematics also is a way for students to embody learning. Because writing …

Conceptualizing And Interpreting Mean And Median With Future Teachers, Eryn M. Stehr, Ha Nguyen, Gregory Chamblee, Sharon Taylor

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

Mathematical Education of Teachers II (METII), echoed by the American Statistical Association publication, Statistical Education of Teachers, recommended teacher preparation programs support future teachers in developing deep understandings of mean and median, such that middle grades teachers may use them to “summarize, describe, and compare distributions” (Conference Board of Mathematical Sciences, 2012, p. 44; Franklin et al., 2015). Georgia Standards of Excellence require statistical reasoning from students beginning as early as 6-7 years old, including interpretation of measures of center and statistical reasoning about best measures of center (Georgia Department of Education, 2015). This level of understanding and interpretation of …

The Relationship Between Housing Affordability And Demographic Factors: Case Study For The Atlanta Beltline, Chapman T. Lindstrom

Electronic Theses and Dissertations

Housing affordability has been a widely examined subject for populations residing in major metropolitan regions around the world. The relationship between housing affordability and the city’s demographics and its volume of urban development are important to take into consideration. In the past two decades there has been an increasing volume of literature detailing Atlanta Georgia’s large-scale redevelopment project, the Atlanta BeltLine (ABL), and its relationship with Atlanta’s Metropolitan population and housing affordability. The first objective of this paper is to study the relationship between housing affordability at two scales within the Atlanta Metropolitan Area (AMA) for both renters and homeowners. …

Taking A Canon To The Adjunction Formula, Paul M. Harrelson

Electronic Theses and Dissertations

In this paper, we show how the canonical divisor of a graph is related to the canonical divisor of its subgraph. The use of chip firing and the adjunction formula for graphs ex- plains said relation and even completes it. We go on to show the difference between the formula for full subgraphs and that of non-full subgraphs. Examples are used to simplify these results and to see the adjunction formula in action. Finally, we show that though the adjunction formula seems simple at first glance, it is somewhat complex and rather useful.

Conflict Free Connectivity And The Conflict-Free-Connection Number Of Graphs, Travis D. Wehmeier

Electronic Theses and Dissertations

We explore a relatively new concept in edge-colored graphs called conflict-free connectivity. A conflict-free path is a (edge-) colored path that has an edge with a color that appears only once. Conflict-free connectivity is the maximal number of internally disjoint conflict-free paths between all pairs of vertices in a graph. We also define the c-conflict-free-connection of a graph G. This is the maximum conflict-free connectivity of G over all c-colorings of the edges of G. In this paper we will briefly survey the works related to conflict-free connectivity. In addition, we will use the probabilistic method to achieve a bound …

Gallai-Ramsey Number For Classes Of Brooms, Benjamin J. Hamlin

Electronic Theses and Dissertations

Given a graph $G$, we consider the problem of finding the minimum number $n$ such that any $k$ edge colored complete graph on $n$ vertices contains either a rainbow colored triangle or a monochromatic copy of the graph $G$, denoted $gr_k(K_{3}:G)$. More precisely we consider $G=B_{m,\ell}$ where $B_{m,\ell}$ is a broom graph with $m$ representing the number of vertices on the handle and $\ell$ representing the number of bristle vertices. We develop a technique to reduce the difficulty of finding $gr_{k}(K_{3}:B_{m,\ell})$, and use the technique to prove a few cases with a fixed handle length, but arbitrarily many bristles. Further, …

Totally Acyclic Complexes, Holly M. Zolt

Electronic Theses and Dissertations

We consider the following question: when is every exact complex of injective modules a totally acyclic one? It is known, for example, that over a commutative Noetherian ring of finite Krull dimension this condition is equivalent with the ring being Iwanaga-Gorenstein. We give equivalent characterizations of the condition that every exact complex of injective modules (over arbitrary rings) is totally acyclic. We also give a dual result giving equivalent characterizations of the condition that every exact complex of flat modules is F-totally acyclic over an arbitrary ring.