Alison Marr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alison Marr has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Bryan Freyberg
University of Minnesota Duluth
2 shared publications Adel Faridani
1 shared publicationAlice Seneres
1 shared publication- Andrea Semaničová-Feňovčíková
Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
1 shared publication Angelynn Alvarez Et Al.
1 shared publication- Christina Napier
Cedarville University
1 shared publication
Latest Publications
- Open Access
New Results on Difference Distance Magic Labelings
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values from one up to the number of vertices so that the sum of labels on the neighbors of any vertex is the same across all vertices. For oriented graphs, a related concept of distance difference magic has been studied. In a distance difference magic labeling, each vertex is given a unique value from one up to the number of vertices such that for each vertex the sums of the labels of vertices in the in-neighborhood minus the sums of the labels of vertices in the out-neighborhood equals zero. In this paper, we expand on this concept by showing a connected difference distance magic oriented graph on $n$ vertices exists for each integer $n \geq 5$. We also construct arbitrarily large difference distance magic oriented graphs from smaller ones using a new graph sum and exhibit a connection between linear algebra and this type of labeling.Open AccessNew Results on Difference Distance Magic Labelings
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values from one up to the number of vertices so that the sum of labels on the neighbors of any vertex is the same across all vertices. For oriented graphs, a related concept of distance difference magic has been studied. In a distance difference magic labeling, each vertex is given a unique value from one up to the number of vertices such that for each vertex the sums of the labels of vertices in the in-neighborhood minus the sums of the labels of vertices in the out-neighborhood equals zero. In this paper, we expand on this concept by showing a connected difference distance magic oriented graph on $n$ vertices exists for each integer $n \geq 5$. We also construct arbitrarily large difference distance magic oriented graphs from smaller ones using a new graph sum and exhibit a connection between linear algebra and this type of labeling. - Open Access
- 4 November 2024
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 11 (4) , 1-18
Difference distance magic oriented graphs
This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.
- 4 November 2024
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 11 (4) , 1-18
Open AccessDifference distance magic oriented graphs
This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.
- Open Access
- 20 September 2024
- Published by Walter de Gruyter GmbH in Recreational Mathematics Magazine
- Vol. 11 (19) , 27-40
Domino Antimagic Squares and Rectangles
A domino antimagic square of order n is an n×n array formed from a subset of the standard set of 28 dominoes such that the sums of the rows, columns, and two main diagonals form a set of 2n + 2 distinct, consecutive integers while an m × n domino antimagic rectangle is an m × n rectangular array formed from a subset of the standard set of 28 dominoes such that the sums of the rows and columns form a set of m + n distinct, consecutive integers. This paper outlines what the possible dimensions are for m×n domino antimagic rectangles and provides many examples of both domino antimagic rectangles and squares. Many open questions are given at the end of the paper for future exploration.
- 20 September 2024
- Published by Walter de Gruyter GmbH in Recreational Mathematics Magazine
- Vol. 11 (19) , 27-40
Open AccessDomino Antimagic Squares and Rectangles
A domino antimagic square of order n is an n×n array formed from a subset of the standard set of 28 dominoes such that the sums of the rows, columns, and two main diagonals form a set of 2n + 2 distinct, consecutive integers while an m × n domino antimagic rectangle is an m × n rectangular array formed from a subset of the standard set of 28 dominoes such that the sums of the rows and columns form a set of m + n distinct, consecutive integers. This paper outlines what the possible dimensions are for m×n domino antimagic rectangles and provides many examples of both domino antimagic rectangles and squares. Many open questions are given at the end of the paper for future exploration.
- Open Access
- 26 March 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-13
Neighborhood Balanced Colorings of Graphs
Given a simple graph G, we ask when V(G) may be partitioned into two sets such that every vertex has an equal number of neighbors from each set. We establish a number of results for common families of graphs and completely classify 4-regular circulants which posses this property.
- 26 March 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-13
Open AccessNeighborhood Balanced Colorings of Graphs
Given a simple graph G, we ask when V(G) may be partitioned into two sets such that every vertex has an equal number of neighbors from each set. We establish a number of results for common families of graphs and completely classify 4-regular circulants which posses this property.
- Open Access
D-Magic Oriented Graphs
In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct integers in such a way that the sum of all the vertex labels that are a distance in D away from a given vertex is the same across all vertices. We give some results related to the magic constant, construct a few infinite families of D-magic graphs, and examine trees, cycles, and multipartite graphs. This definition grew out of the definition of D-magic (undirected) graphs. This paper explores some of the symmetries we see between the undirected and directed version of D-magic labelings.Open AccessD-Magic Oriented Graphs
In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct integers in such a way that the sum of all the vertex labels that are a distance in D away from a given vertex is the same across all vertices. We give some results related to the magic constant, construct a few infinite families of D-magic graphs, and examine trees, cycles, and multipartite graphs. This definition grew out of the definition of D-magic (undirected) graphs. This paper explores some of the symmetries we see between the undirected and directed version of D-magic labelings. - 24 June 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1603-1611
Note on in-antimagicness and out-antimagicness of digraphs
A digraph D is called (a, d)-vertex-in-antimagic ((a, d)-vertex-out-antimagic) if it is possible to label its vertices and arcs with distinct numbers from the set {1, 2, … ,|V(D)|+|A(D)|} such that the set of all in-vertex-weights (out-vertex-weights) form an arithmetic sequence with initial term a and a common difference d, where a > 0, d ≥ 0 are integers. The in-vertex-weight (out-vertex-weight) of a vertex n ϵ V(D) is defined as the sum of the vertex label and the labels of arcs ingoing (outgoing) to n. Moreover, if the smallest numbers are used to label the vertices of D such a graph is called super. In this paper we will deal with in-antimagicness and out-antimagicness of in-regular and out-regular digraphs.
- 24 June 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1603-1611
Note on in-antimagicness and out-antimagicness of digraphs
A digraph D is called (a, d)-vertex-in-antimagic ((a, d)-vertex-out-antimagic) if it is possible to label its vertices and arcs with distinct numbers from the set {1, 2, … ,|V(D)|+|A(D)|} such that the set of all in-vertex-weights (out-vertex-weights) form an arithmetic sequence with initial term a and a common difference d, where a > 0, d ≥ 0 are integers. The in-vertex-weight (out-vertex-weight) of a vertex n ϵ V(D) is defined as the sum of the vertex label and the labels of arcs ingoing (outgoing) to n. Moreover, if the smallest numbers are used to label the vertices of D such a graph is called super. In this paper we will deal with in-antimagicness and out-antimagicness of in-regular and out-regular digraphs.
- Open Access
- 1 July 2019
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 9 (2) , 44-59
Choose Your Own Adventure: An Analysis of Interactive Gamebooks Using Graph Theory
- 1 July 2019
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 9 (2) , 44-59
Open AccessChoose Your Own Adventure: An Analysis of Interactive Gamebooks Using Graph Theory
- 1 May 2019
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 65 (05)
The PCMI Workshop for Mentors: A Weeklong Workshop on Diversity?
- 1 May 2019
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 65 (05)
The PCMI Workshop for Mentors: A Weeklong Workshop on Diversity?
- 15 August 2018
- Published by Taylor & Francis in PRIMUS
- Vol. 28 (9) , 875-889
Taking Mathematics Abroad: A How-To Guide
This paper summarizes the experiences of two mathematics faculty members who participated in an in-house study abroad program. Descriptions of math courses taught abroad are given, as well as how students were recruited, courses were designed, and the environment was incorporated. Tips for mathematics faculty wanting to offer study abroad are given and impacts on the students are discussed.
- 15 August 2018
- Published by Taylor & Francis in PRIMUS
- Vol. 28 (9) , 875-889
Taking Mathematics Abroad: A How-To Guide
This paper summarizes the experiences of two mathematics faculty members who participated in an in-house study abroad program. Descriptions of math courses taught abroad are given, as well as how students were recruited, courses were designed, and the environment was incorporated. Tips for mathematics faculty wanting to offer study abroad are given and impacts on the students are discussed.
- 1 July 2015
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 48, 3-10
Sparse Semi-Magic Squares and Magic Labelings of Directed Graphs
- 1 July 2015
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 48, 3-10
Sparse Semi-Magic Squares and Magic Labelings of Directed Graphs