Zero forcing and power domination for graph products K Benson, D Ferrero, M Flagg, L Hogben, V Furst, V Vasilevska, ... | 78* | 2018 |
Power domination in cylinders, tori, and generalized Petersen graphs R Barrera, D Ferrero Networks 58 (1), 43-49, 2011 | 57 | 2011 |
Algebraic properties of a digraph and its line digraph C Balbuena, D Ferrero, X Marcote, I Pelayo Journal of Interconnection Networks 4 (4), 377-393, 2003 | 30 | 2003 |
Restricted power domination and zero forcing problems C Bozeman, B Brimkov, C Erickson, D Ferrero, M Flagg, L Hogben Journal of Combinatorial Optimization 37, 935-956, 2019 | 29 | 2019 |
Note on power propagation time and lower bounds for the power domination number D Ferrero, L Hogben, FHJ Kenter, M Young Journal of Combinatorial Optimization 34, 736-741, 2017 | 24 | 2017 |
The zero forcing polynomial of a graph K Boyer, B Brimkov, S English, D Ferrero, A Keller, R Kirsch, M Phillips, ... Discrete Applied Mathematics 258, 35-48, 2019 | 21 | 2019 |
The relationship between k-forcing and k-power domination D Ferrero, L Hogben, FHJ Kenter, M Young Discrete Mathematics 341 (6), 1789-1797, 2018 | 20 | 2018 |
Power domination in honeycomb networks D Ferrero, S Varghese, A Vijayakumar Journal of Discrete Mathematical Sciences and Cryptography 14 (6), 521-529, 2011 | 20 | 2011 |
Edge-connectivity and super edge-connectivity of P2-path graphs C Balbuena, D Ferrero Discrete Mathematics 269 (1-3), 13-20, 2003 | 19 | 2003 |
Nordhaus–Gaddum problems for power domination KF Benson, D Ferrero, M Flagg, V Furst, L Hogben, V Vasilevska Discrete Applied Mathematics 251, 103-113, 2018 | 17* | 2018 |
Diameter variability of cycles and tori JJ Wang, TY Ho, D Ferrero, TY Sung Information Sciences 178 (14), 2960-2967, 2008 | 17 | 2008 |
Component connectivity of generalized Petersen graphs D Ferrero, S Hanusch International Journal of Computer Mathematics 91 (9), 1940-1963, 2014 | 16 | 2014 |
Functigraphs: an extension of permutation graphs A Chen, D Ferrero, R Gera, E Yi Mathematica Bohemica 136 (1), 27-37, 2011 | 15 | 2011 |
Connectivity and fault-tolerance of hyperdigraphs D Ferrero, C Padró Discrete applied mathematics 117 (1-3), 15-26, 2002 | 15 | 2002 |
Disjoint paths of bounded length in large generalized cycles D Ferrero, C Padró Discrete mathematics 197, 285-298, 1999 | 15 | 1999 |
Rigid linkages and partial zero forcing. D Ferrero, M Flagg, HT Hall, L Hogben, JCHL Lin, SA Meyer, S Nasserasr, ... Electronic Journal of Combinatorics 26 (2), 2019 | 10 | 2019 |
The structure of super line graphs J Bagga, D Ferrero, R Ellis 8th International Symposium on Parallel Architectures, Algorithms and …, 2005 | 10* | 2005 |
Minimum rank and zero forcing number for butterfly networks D Ferrero, C Grigorious, T Kalinowski, J Ryan, S Stephen Journal of Combinatorial Optimization 37, 970-988, 2019 | 8 | 2019 |
Zero forcing in iterated line digraphs D Ferrero, T Kalinowski, S Stephen Discrete Applied Mathematics 255, 198-208, 2019 | 7 | 2019 |
Containers and wide diameters of D Ferrero, MK Menon, A Vijayakumar Mathematica Bohemica 137 (4), 383-393, 2012 | 7 | 2012 |