Daniela Ferrero

Publication Activity (10 Years)

Years Active: 1997-2019
Publications (10 Years): 10

Top Topics

Graph Structures

Power Consumption

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Electron. J. Comb.

Publications

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
Minimum rank and zero forcing number for butterfly networks. J. Comb. Optim. 37 (3) (2019)
Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart
The zero forcing polynomial of a graph. Discret. Appl. Math. 258 (2019)
Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen
Zero forcing in iterated line digraphs. Discret. Appl. Math. 255 (2019)
Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader
Rigid Linkages and Partial Zero Forcing. Electron. J. Comb. 26 (2) (2019)
Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben
Restricted power domination and zero forcing problems. J. Comb. Optim. 37 (3) (2019)
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young
The relationship between k-forcing and k-power domination. Discret. Math. 341 (6) (2018)
Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska
Nordhaus-Gaddum problems for power domination. Discret. Appl. Math. 251 (2018)
Daniela Ferrero, Linda M. Lesniak
-Partite Graphs. Graphs Comb. 34 (6) (2018)
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young
Note on power propagation time and lower bounds for the power domination number. J. Comb. Optim. 34 (3) (2017)
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
Minimum rank and zero forcing number for butterfly networks. CoRR (2016)
Daniela Ferrero, Sarah Hanusch
Component connectivity of generalized Petersen graphs. Int. J. Comput. Math. 91 (9) (2014)
Roberto Barrera, Daniela Ferrero
Power domination in cylinders, tori, and generalized Petersen graphs. Networks 58 (1) (2011)
Jeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero, Ting-Yi Sung
Diameter variability of cycles and tori. Inf. Sci. 178 (14) (2008)
Daniela Ferrero
Product Line Sigraphs. ISPAN (2008)
Daniela Ferrero
Some properties of superline digraphs. ITNG (2007)
Jay S. Bagga, Daniela Ferrero
The structure of super line graphs. ISPAN (2005)
Camino Balbuena, Xavier Marcote, Daniela Ferrero
Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45 (2) (2005)
Camino Balbuena, Daniela Ferrero
-path graphs. Discret. Math. 269 (1-3) (2003)
Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo
Algebraic properties of a digraph and its line digraph. J. Interconnect. Networks 4 (4) (2003)
Daniela Ferrero, Frank Harary
Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80 (7) (2003)
Daniela Ferrero, Carles Padró
Partial line directed hypergraphs. Networks 39 (2) (2002)
Daniela Ferrero, Carles Padró
Connectivity and fault-tolerance of hyperdigraphs. Discret. Appl. Math. 117 (1-3) (2002)
Daniela Ferrero, Carles Padró
New bounds on the diameter vulnerability of iterated line digraphs. Discret. Math. 233 (1-3) (2001)
Daniela Ferrero
A Technique for the (d, s, N)-Bus Network Problem. SCCC (1999)
Daniela Ferrero, Carles Padró
Disjoint paths of bounded length in large generalized cycles. Discret. Math. (1999)
Daniela Ferrero, Carles Padró
Fault-Tolerant Routings in Large Generalized Cycles. SCCC (1997)