Follow
Daniela Ferrero
Daniela Ferrero
Verified email at txstate.edu - Homepage
Title
Cited by
Cited by
Year
Zero forcing and power domination for graph products
K Benson, D Ferrero, M Flagg, L Hogben, V Furst, V Vasilevska, ...
75*2018
Power domination in cylinders, tori, and generalized Petersen graphs
R Barrera, D Ferrero
Networks 58 (1), 43-49, 2011
552011
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
302003
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
282019
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
242017
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
202019
The relationship between k-forcing and k-power domination
D Ferrero, L Hogben, FHJ Kenter, M Young
Discrete Mathematics 341 (6), 1789-1797, 2018
192018
Power domination in honeycomb networks
D Ferrero, S Varghese, A Vijayakumar
Journal of Discrete Mathematical Sciences and Cryptography 14 (6), 521-529, 2011
192011
Edge-connectivity and super edge-connectivity of P2-path graphs
C Balbuena, D Ferrero
Discrete Mathematics 269 (1-3), 13-20, 2003
192003
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
16*2018
Component connectivity of generalized Petersen graphs
D Ferrero, S Hanusch
International Journal of Computer Mathematics 91 (9), 1940-1963, 2014
162014
Diameter variability of cycles and tori
JJ Wang, TY Ho, D Ferrero, TY Sung
Information Sciences 178 (14), 2960-2967, 2008
162008
Functigraphs: an extension of permutation graphs
A Chen, D Ferrero, R Gera, E Yi
Mathematica Bohemica 136 (1), 27-37, 2011
152011
Connectivity and fault-tolerance of hyperdigraphs
D Ferrero, C Padró
Discrete applied mathematics 117 (1-3), 15-26, 2002
152002
Disjoint paths of bounded length in large generalized cycles
D Ferrero, C Padró
Discrete mathematics 197, 285-298, 1999
151999
The structure of super line graphs
J Bagga, D Ferrero, R Ellis
8th International Symposium on Parallel Architectures, Algorithms and …, 2005
10*2005
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
92019
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
82019
On eccentricity sequences of connected graphs
D Ferrero, F Harary, S Arumugam
AKCE International Journal of Graphs and Combinatorics 6 (3), 401-408, 2009
82009
Zero forcing in iterated line digraphs
D Ferrero, T Kalinowski, S Stephen
Discrete Applied Mathematics 255, 198-208, 2019
72019
The system can't perform the operation now. Try again later.
Articles 1–20