Daniela Ferrero - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2019

The zero forcing polynomial of a graphKirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart. DAM, 258:35-48, 2019. [doi]

Restricted power domination and zero forcing problemsChassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben. jco, 37(3):935-956, 2019. [doi]

Zero forcing in iterated line digraphsDaniela Ferrero, Thomas Kalinowski, Sudeep Stephen. DAM, 255:198-208, 2019. [doi]

Minimum rank and zero forcing number for butterfly networksDaniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan 0001, Sudeep Stephen. jco, 37(3):970-988, 2019. [doi]

Rigid Linkages and Partial Zero ForcingDaniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader. combinatorics, 26(2):2, 2019. [doi]

2018

Nordhaus-Gaddum problems for power dominationKatherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska. DAM, 251:103-113, 2018. [doi]

k-Partite GraphsDaniela Ferrero, Linda Lesniak. gc, 34(6):1565-1580, 2018. [doi]

The relationship between k-forcing and k-power dominationDaniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young. DM, 341(6):1789-1797, 2018. [doi]

2017

Note on power propagation time and lower bounds for the power domination numberDaniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young. jco, 34(3):736-741, 2017. [doi]

2014

Component connectivity of generalized Petersen graphsDaniela Ferrero, Sarah Hanusch. ijcm, 91(9):1940-1963, 2014. [doi]

2011

Power domination in cylinders, tori, and generalized Petersen graphsRoberto Barrera, Daniela Ferrero. networks, 58(1):43-49, 2011. [doi]

2008

Product Line SigraphsDaniela Ferrero. ispan 2008: 141-145 [doi]

Diameter variability of cycles and toriJeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero, Ting-Yi Sung. isci, 178(14):2960-2967, 2008. [doi]

2007

Some properties of superline digraphsDaniela Ferrero. itng 2007: 1073-1076 [doi]

2005

The structure of super line graphsJay Bagga, Daniela Ferrero. ispan 2005: 468-471 [doi]

Diameter vulnerability of iterated line digraphs in terms of the girthCamino Balbuena, Xavier Marcote, Daniela Ferrero. networks, 45(2):49-54, 2005. [doi]

2003

Algebraic properties of a digraph and its line digraphCamino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo. join, 4(4):377-393, 2003. [doi]

Edge-connectivity and super edge-connectivity of ::::P::::::2::-path graphsCamino Balbuena, Daniela Ferrero. DM, 269(1-3):13-20, 2003. [doi]

Edge Sums of Debruijn Interconnection NetworksDaniela Ferrero, Frank Harary. ijcm, 80(7):819-824, 2003. [doi]

2002

Connectivity and fault-tolerance of hyperdigraphsDaniela Ferrero, Carles Padró. DAM, 117(1-3):15-26, 2002.

Partial line directed hypergraphsDaniela Ferrero, Carles Padró. networks, 39(2):61-67, 2002. [doi]

2001

New bounds on the diameter vulnerability of iterated line digraphsDaniela Ferrero, Carles Padró. DM, 233(1-3):103-113, 2001. [doi]

1999

Disjoint paths of bounded length in large generalized cyclesDaniela Ferrero, Carles Padró. DM, 197-198:285-298, 1999. [doi]

A Technique for the (d, s, N)-Bus Network ProblemDaniela Ferrero. sccc 1999: 129-135 [doi]

1997

Fault-Tolerant Routings in Large Generalized CyclesDaniela Ferrero, Carles Padró. sccc 1997: 58-65 [doi]

Sign in or sign up to see more results.

runs on WebDSL