Daniela Ferrero

According to our database, Daniela Ferrero authored at least 25 papers between 1997 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Minimum rank and zero forcing number for butterfly networks.

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen

J. Comb. Optim., 2019

Restricted power domination and zero forcing problems.

Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben

J. Comb. Optim., 2019

Zero forcing in iterated line digraphs.

Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen

Discret. Appl. Math., 2019

The zero forcing polynomial of a graph.

Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart

Discret. Appl. Math., 2019

Rigid Linkages and Partial Zero Forcing.

Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader

Electron. J. Comb., 2019

2018

Chorded Pancyclicity in <i>k</i>-Partite Graphs.

Daniela Ferrero, Linda M. Lesniak

Graphs Comb., 2018

The relationship between k-forcing and k-power domination.

Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young

Discret. Math., 2018

Nordhaus-Gaddum problems for power domination.

Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska

Discret. Appl. Math., 2018

2017

Note on power propagation time and lower bounds for the power domination number.

Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young

J. Comb. Optim., 2017

2014

Component connectivity of generalized Petersen graphs.

Daniela Ferrero, Sarah Hanusch

Int. J. Comput. Math., 2014

2011

Power domination in cylinders, tori, and generalized Petersen graphs.

Roberto Barrera, Daniela Ferrero

Networks, 2011

2008

Diameter variability of cycles and tori.

Jeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero, Ting-Yi Sung

Inf. Sci., 2008

Product Line Sigraphs.

Daniela Ferrero

Proceedings of the 9th International Symposium on Parallel Architectures, 2008

2007

Some properties of superline digraphs.

Daniela Ferrero

Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

2005

Diameter vulnerability of iterated line digraphs in terms of the girth.

Camino Balbuena, Xavier Marcote, Daniela Ferrero

Networks, 2005

The structure of super line graphs.

Jay S. Bagga, Daniela Ferrero

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2003

Algebraic properties of a digraph and its line digraph.

Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo

J. Interconnect. Networks, 2003

Edge Sums of Debruijn Interconnection Networks.

Daniela Ferrero, Frank Harary

Int. J. Comput. Math., 2003

Edge-connectivity and super edge-connectivity of <i>P</i>₂-path graphs.

Camino Balbuena, Daniela Ferrero

Discret. Math., 2003

2002

Partial line directed hypergraphs.

Daniela Ferrero, Carles Padró

Networks, 2002

Connectivity and fault-tolerance of hyperdigraphs.

Daniela Ferrero, Carles Padró

Discret. Appl. Math., 2002

2001

New bounds on the diameter vulnerability of iterated line digraphs.

Daniela Ferrero, Carles Padró

Discret. Math., 2001

1999

Disjoint paths of bounded length in large generalized cycles.

Daniela Ferrero, Carles Padró

Discret. Math., 1999

A Technique for the (d, s, N)-Bus Network Problem.

Daniela Ferrero

Proceedings of the 19th International Conference of the Chilean Computer Science Society (SCCC '99), 1999

1997

Fault-Tolerant Routings in Large Generalized Cycles.

Daniela Ferrero, Carles Padró

Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997