12 citations · 31 across the 6 of their papers we have counts for
6 papers
The N-queens Problem on a symmetric Toeplitz matrix
Zsuzsanna Szaniszlo, Maggy Tomova, Cindy Wyels
We consider the problem of placing nonattacking queens on a symmetric Toeplitz matrix. As in the -queens Problem on a chessboard, two queens may attack each oth…
Radio numbers for generalized prism graphs
Paul Martinez, Juan Ortiz, Maggy Tomova +1
A radio labeling is an assignment such that every distinct pair of vertices satisfies the inequality $d(u,v)+|c(u)-c(v)|\geq \diam(G)+1$. The…
The Radio Number of
Marc Morris-Rivera, Maggy Tomova, Cindy Wyels +1
Radio labeling is a variation of Hale's channel assignment problem, in which one seeks to assign positive integers to the vertices of a graph subject to certain constraints inv…
The Radio Number of Gear Graphs
Christina Fernandez, América Flores, Maggy Tomova +1
Let denote the distance between two distinct vertices of a connected graph , and $\diam(G)$ be the diameter of . A radio labeling of is an assignment of posi…
Optimal pebbling of paths and cycles
T. Friedman, C. Wyels
Distributions of pebbles to the vertices of a graph are said to be solvable when a pebble may be moved to any specified vertex using a sequence of admissible pebbling rules. The op…
Cover pebbling cycles and certain graph products
Maggy Tomova, Cindy Wyels
A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a…