Daniela Ferrero

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