Amanda Niedzialomski

collaborators

2 papers

math.CO2020

Radio number of Hamming graphs of diameter 3

Jason DeVito, Amanda Niedzialomski, Jennifer Warren

For $G$ a simple, connected graph, a vertex labeling $f : V (G) \to Z_{+}$ is called a $radio labeling of$ $G$ if it satisfies $|f(u)-f(v)|\geq \operatorname{di…

math.CO2012

Cartesian powers of graphs and consecutive radio labelings

Amanda Niedzialomski

For $k \in Z^{+}$ and $G$ a simple connected graph, a $k$ -radio labeling $f : V_{G} \to Z^{+}$ of $G$ requires all pairs of distinct vertices $u$ and $v$ to satisfy $|f(u)-f(v)|\geq…