Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 15 of 15

Full-Text Articles in Physical Sciences and Mathematics

Combinatorially Orthogonal Paths, Sean A. Bailey, David E. Brown, Leroy Beaseley Nov 2023

Combinatorially Orthogonal Paths, Sean A. Bailey, David E. Brown, Leroy Beaseley

Communications on Number Theory and Combinatorial Theory

Vectors x=(x1,x2,...,xn)T and y=(y1,y2,...,yn)T are combinatorially orthogonal if |{i:xiyi≠0}|≠1. An undirected graph G=(V,E) is a combinatorially orthogonal graph if there exists f:V→ℝn such that for any u,vV, uvE iff f(u) and f(v) are combinatorially orthogonal. We will show that every graph has a combinatorially orthogonal representation. We will show …


The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales Sep 2023

The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales

Rose-Hulman Undergraduate Mathematics Journal

DNA and other polymer chains in confined spaces behave like closed loops. Arsuaga et al. \cite{AB} introduced the uniform random polygon model in order to better understand such loops in confined spaces using probabilistic and knot theoretical techniques, giving some classification on the mean squared linking number of such loops. Flapan and Kozai \cite{flapan2016linking} extended these techniques to find the mean sum of squared linking numbers for random linear embeddings of complete graphs $K_n$ and found it to have order $\Theta(n(n!))$. We further these ideas by inspecting random piecewise-linear embeddings of complete graphs and give introductory-level summaries of the ideas …


Iterated Jump Graphs, Fran Herr, Legrand Jones Ii Feb 2023

Iterated Jump Graphs, Fran Herr, Legrand Jones Ii

Rose-Hulman Undergraduate Mathematics Journal

The jump graph J(G) of a simple graph G has vertices which represent edges in G where two vertices in J(G) are adjacent if and only if the corresponding edges in G do not share an endpoint. In this paper, we examine sequences of graphs generated by iterating the jump graph operation and characterize the behavior of this sequence for all initial graphs. We build on work by Chartrand et al. who showed that a handful of jump graph sequences terminate and two sequences converge. We extend these results by showing that there are no non-trivial repeating sequences of jump …


The Chromatic Index Of Ring Graphs, Lilian Shaffer Feb 2023

The Chromatic Index Of Ring Graphs, Lilian Shaffer

Rose-Hulman Undergraduate Mathematics Journal

The goal of graph edge coloring is to color a graph G with as few colors as possible such that each edge receives a color and that adjacent edges, that is, different edges incident to a common vertex, receive different colors. The chromatic index, denoted χ′(G), is the minimum number of colors required for such a coloring to be possible. There are two important lower bounds for χ′(G) on every graph: maximum degree, denoted ∆(G), and density, denoted ω(G). Combining these two lower bounds, we know that every graph’s chromatic index must be at least ∆(G) or …


Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox Jul 2022

Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox

Theory and Applications of Graphs

In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular subgroup of the integers modulo m, where m is the number of edges of the graph. We expand upon these results by first exploring the numerical properties when adding values from cosets and subcosets in the integers modulo m. …


How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli Apr 2022

How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli

The Review: A Journal of Undergraduate Student Research

The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …


Intersection Cographs And Aesthetics, Robert Haas Jan 2022

Intersection Cographs And Aesthetics, Robert Haas

Journal of Humanistic Mathematics

Cographs are complete graphs with colored lines (edges); in an intersection cograph, the points (vertices) and lines (edges) are labeled by sets, and the line between each pair of points is (or represents) their intersection. This article first presents the elementary theory of intersection cographs: 15 are possible on 4 points; constraints on the triangles and quadrilaterals; some forbidden configurations; and how, under suitable constraints, to generate the points from the lines alone. The mathematical theory is then applied to aesthetics, using set cographs to describe the experience of a person enjoying a picture (Mu Qi), poem (Dickinson), play (Shakespeare), …


Domino Circles, Lauren L. Rose, A. Gwinn Royal, Amanda Serenevy, Anna Varvak Aug 2021

Domino Circles, Lauren L. Rose, A. Gwinn Royal, Amanda Serenevy, Anna Varvak

Journal of Math Circles

Creating a circle with domino pieces has a connection with complete graphs in Graph Theory. We present a hands-on activity for all ages, using dominoes to explore problem solving, pattern recognition, parity, graph theory, and combinatorics. The activities are suitable for elementary school students, the graph theory interpretations are suitable for middle and high school students, and the underlying mathematical structures will be of interest to college students and beyond.


New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis Jul 2021

New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis

Rose-Hulman Undergraduate Mathematics Journal

For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and all edges directed into z and all the labels of edges that are directed away from z. A subtractive magic graph has every subtractive edge and vertex weight equal to some constant k. In this paper, we will discuss variations of subtractive magic labelings on …


Dna Self-Assembly Design For Gear Graphs, Chiara Mattamira Nov 2020

Dna Self-Assembly Design For Gear Graphs, Chiara Mattamira

Rose-Hulman Undergraduate Mathematics Journal

Application of graph theory to the well-known complementary properties of DNA strands has resulted in new insights about more efficient ways to form DNA nanostructures, which have been discovered as useful tools for drug delivery, biomolecular computing, and biosensors. The key concept underlying DNA nanotechnology is the formation of complete DNA complexes out of a given collection of branched junction molecules. These molecules can be modeled in the abstract as portions of graphs made up of vertices and half-edges, where complete edges are representations of double-stranded DNA pieces that have joined together. For efficiency, one aim is to minimize the …


Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle Jan 2020

Consecutive Prime And Highly Total Prime Labeling In Graphs, Robert Scholle

Rose-Hulman Undergraduate Mathematics Journal

This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982. Consecutive prime labeling is defined here for the first time. Consecutive prime labeling requires that the labels of vertices in a graph be relatively prime to the labels of all adjacent vertices as well as all incident edges. We show that all paths, cycles, stars, and complete graphs have a consecutive prime labeling and conjecture that all simple connected graphs have a consecutive prime labeling.

This paper also expands on work …


A Novel Graph-Operational Matrix Method For Solving Multidelay Fractional Differential Equations With Variable Coefficients And A Numerical Comparative Survey Of Fractional Derivative Types, Ömür Kivanç Kürkçü, Ersi̇n Aslan, Mehmet Sezer Jan 2019

A Novel Graph-Operational Matrix Method For Solving Multidelay Fractional Differential Equations With Variable Coefficients And A Numerical Comparative Survey Of Fractional Derivative Types, Ömür Kivanç Kürkçü, Ersi̇n Aslan, Mehmet Sezer

Turkish Journal of Mathematics

In this study, we introduce multidelay fractional differential equations with variable coefficients in a unique formula. A novel graph-operational matrix method based on the fractional Caputo, Riemann-Liouville, Caputo-Fabrizio, and Jumarie derivative types is developed to efficiently solve them. We also make use of the collocation points and matrix relations of the matching polynomial of the complete graph in the method. We determine which of the fractional derivative types is more appropriate for the method. The solutions of model problems are improved via a new residual error analysis technique. We design a general computer program module. Thus, we can explicitly monitor …


Breastmilk And Theorems, Bonnie Jacob Jul 2018

Breastmilk And Theorems, Bonnie Jacob

Journal of Humanistic Mathematics

Breastmilk and Theorems is a poem that traces a mother’s journey breastfeeding her baby over the course of the baby’s first months of life, while mentally working on proving a theorem.


Patterns Formed By Coins, Andrey M. Mishchenko Jul 2016

Patterns Formed By Coins, Andrey M. Mishchenko

Journal of Humanistic Mathematics

This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non- overlapping circles. The first half of the article is an exposition of the two most important facts about circle packings, (1) that essentially whatever pattern we ask for, we may always arrange circles in that pattern, and (2) that under simple conditions on the pattern, there is an essentially unique arrangement of circles in that pattern. In the second half of the article, we consider related questions, but where we …


Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak Jan 2015

Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak

Theory and Applications of Graphs

The (vertex) path-table of a tree Τ contains quantitative information about the paths in Τ. The entry (i,j) of this table gives the number of paths of length j passing through vertex vi. The path-table is a slight variation of the notion of path layer matrix. In this survey we review some work done on the vertex path-table of a tree and also introduce the edge path-table. We show that in general, any type of path-table of a tree Τ does not determine Τ uniquely. We shall show that in trees, the number of paths passing through …