Richard M. Low

Richard M. Low


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2016 in Electronic Journal of Graph Theory and Applications
Verified
Journal Article
Open access
PDF file
RLRichard M. Low
Richard M. Low
WCW.H. Chan
W.H. Chan
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graphs which was introduced by N.J. Calkin et al.: Two players alternate turns, each time choosing a vertex $v$ of a finite graph and removing any number $(\geq 1)$ of edges incident to $v$. The player who cannot make a move loses the game. Here, we analyze Graph Nim for various classes of graphs and also compute some Grundy-values.

1 January 2024 in Theory and Applications of Graphs
Verified
Journal Article
Open access
PDF file
TKThe Chinese University of Hong Kong
The Chinese University of Hong Kong
WSWai Chee Shiu
Wai Chee Shiu
RLRichard M. Low
Richard M. Low
SUSan Jose State University
San Jose State University
ALAndy Liu
Andy Liu
For a plane graph $G = (V, E)$ embedded in $\mathbb{R}^2$, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a \textit{$C_n$-face-magic graph} if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any $F \in \mathcal{F}(G)$ with $F \cong C_n$, the sum of all the vertex labels along $C_n$ is a constant $c$. In this paper, we investigate face-magic labelings of polygonal graphs.

5 February 2016 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
SSStavros G. Stavrou
Stavros G. Stavrou
RLRichard M. Low
Richard M. Low
NHNicholas J. Hernandez
Nicholas J. Hernandez
We consider tensors of format over the finite field . We use computer algebra to classify these tensors by their tensor rank, thus determining the maximum tensor rank to be 9. As a corollary, we provide a new upper bound that the maximum rank of an order-n tensor of format , for , over is at most . We also determine that there are 261 canonical forms of the rank 9 (maximum rank) tensors under the action of , the semi-direct product of (a direct product of) general linear groups with the symmetric group on five elements.

4 March 2017 in Linear and Multilinear Algebra
Verified
Journal Article
Open access
SSStavros G. Stavrou
Stavros G. Stavrou
RLRichard M. Low
Richard M. Low
NHNicholas J. Hernandez
Nicholas J. Hernandez
In this note, we correctly determine the orbits of the (maximum) rank nine tensors under the action of , the semi-direct product of (a direct product of) general linear groups with the symmetric group on five elements. Under this group action, there are two orbits and hence, two canonical forms.

8 February 2016 in Theory and Applications of Graphs
Verified
Journal Article
Open access
PDF file
DRDan Roberts
Dan Roberts
RLRichard M. Low
Richard M. Low
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$ $\{f(u,v): (u, v) \in E(G) \}$, is a one-to-one map. The \textit{integer-antimagic spectrum} of a graph $G$ is the set IAM$(G) = \{k: G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic and } k \geq 2\}$. In this paper, we analyze the integer-antimagic spectra for various classes of multi-cyclic graphs.

29 October 2022 in Electronic Journal of Graph Theory and Applications
Verified
Journal Article
Open access
PDF file
RLRichard M. Low
Richard M. Low
AKArdak Kapbasov
Ardak Kapbasov
AKArman Kapbasov
Arman Kapbasov
SBSergey Bereg
Sergey Bereg
For various connected simple graphs G, we extend the table of diagonal graph Ramsey numbers R(G, G) in ‘An Atlas of Graphs.’ This is accomplished by first converting the calculation of R(G, G) into a satisfiability problem in propositional logic. Mathematical arguments and scientific computing are then used to calculate R(G, G).