12 citations · 24 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008★ 12 cited
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…
math.CO2005★ 8 cited
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…
math.CO2004★ 4 cited
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…