44 citations · 263 across the 29 of their papers we have counts for
Showing 2016 · cs.DMShow all
2 papers · 2 filters
cs.DM2016★ 4 cited
On the power domination number of de Bruijn and Kautz digraphs
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1
Let be a directed graph without parallel arcs, and let be a set of vertices. Let the sequence be defined a…
cs.DM2016★ 1 cited
-supermagic labelings for firecrackers, banana trees and flowers
Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1
A simple graph admits an -covering if every edge in is contained in a subgraph of which is isomorphic to . In this case we say that is -…