Faculty Profiles

Anderson, S. E., Collins, K. L., Ferrero, D., Hogben, L., Mayer, C., Trenk, A. N., & Walker, S. (2023). Product throttling for power domination. Australasian Journal of Combinatorics, 85(3), 248–272.

Ferrero, D., Hogben, L., Kingan, S., & Matthews, G. L. (2021). Research Trends in Graph Theory and Applications. Cham, Switzerland: Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-030-77983-2

Anderson, S. E., Collins, K. L., Ferrero, D., Hogben, L., Mayer, C., Trenk, A. N., & Walker, S. (2021). Product Throttling. In Ferrero D., Hogben L., Kingan S.R., Matthews G.L. (eds) Research Trends in Graph Theory and Applications. Association for Women in Mathematics Series, Vol XXV. Cham, Switzerland: Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-030-77983-2_2

Ferrero, D., Flagg, M., Hall, H. T., Hogben, L., Lin, J. C.-H., Meyer, S. A., … Shader, B. (2019). Rigid linkages and partial zero forcing. Electronic Journal of Combinatorics, 26(2). https://doi.org/10.37236/8097

Ferrero, D., Gregorious, C., Kalinowski, T., Ryan, J., & Stephen, S. (2019). Minimum rank and zero forcing number for butterfly networks. Journal of Combinatorial Optimization, 37(3), 970–988. https://doi.org/10.1007/s10878-018-0335-1

Ferrero, D., Boyer, K., Brimkov, B., English, S., Keller, A., Kirsch, R., … Reinhart, C. (2019). The zero forcing polynomial of a graph. Discrete Applied Mathematics, 258, 35–48. https://doi.org/10.1016/j.dam.2018.11.033

Bozeman, C., Brimkov, B., Erickson, C., Ferrero, D., Flagg, M., & Hogben, L. (2019). Restricted power domination and zero forcing problems. Journal of Combinatorial Optimization, 33(3), 935–956. https://doi.org/10.1007/s10878-018-0330-6

Ferrero, D., Kalinowski, T., & Stephen, S. (2019). Zero forcing in iterated line digraphs. Discrete Applied Mathematics, 255, 198–208. https://doi.org/10.1016/j.dam.2018.08.019

Benson, K. F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., & Vasilevska, V. (2018). Nordhaus-Gaddum problems for power domination. Discrete Applied Mathematics, 251, 103–113. https://doi.org/10.1016/j.dam.2018.06.004

Deines, A., Ferrero, D., Graham, E., Manore, C., Price, C., & Seong Im, M. (Eds.). (2018). Advances in the Mathematical Sciences. Cham, Switzerland: Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-319-98684-5

Ferrero, D., Hogben, L., Kenter, F. H. J., & Young, M. (2018). The relationship between k-forcing and k-power domination. Discrete Mathematics, 341(6), 1789–1797. https://doi.org/10.1016/j.disc.2017.10.031

Ferrero, D., & Lesniak, L. (2018). Chorded pancyclicity in k-partite graphs. Graphs and Combinatorics, 34, 1565–1580. https://doi.org/10.1007/s00373-018-1942-4

Benson, K., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., & Wissman, B. (2018). Zero forcing and power domination for graph products. Australasian Journal of Combinatorics, 70(2), 221–235.

Ferrero, D., Hogben, L., Kenter, F. H. J., & Young, M. (2017). Note on power propagation time and lower bounds for the power domination number. Journal of Combinatorial Optimization, 34(3), 736–741. https://doi.org/10.1007/s10878-016-0103-z

Ferrero, D., & Hanusch, S. (2014). Component connectivity in generalized Petersen graphs. International Journal of Computer Mathematics, 91(9), 1940–1963. https://doi.org/10.1080 / 00207160.2013.878023

Ferrero, D., Menon, M. K., & Vijayakumar, A. (2012). Containers and wide diameters of P3 graphs. Mathematica Bohemica, 137(4), 383–393. https://doi.org/10.21136/MB.2012.142994

Barrera, R., & Ferrero, D. (2011). Power domination in cylinders, tori and generalized Petersen graphs. Networks, 58(1), 43–49. https://doi.org/10.1002/net.20413

Chen, A., Ferrero, D., Gera, R., & Yi, E. (2011). Functigraphs: a generalization of permutation graphs. Mathematica Bohemica, 136(1), 27–37. https://doi.org/10.21136/MB.2011.141447

Ferrero, D., Varghese, S., & Vijayakumar, A. (2011). Power domination in honeycomb networks. Journal of Discrete Mathematical Sciences and Cryptography, 14(6), 521–529. https://doi.org/10.1080/09720529.2011.10698353

Bagga, J., Ellis, R. E., & Ferrero, D. (2010). The spectra of superline multigraph. In Acharya B.D., Katona G.O.H., Nešetil, J. (eds) Advances in discrete mathematics and applications. Ramanujan Mathematical Society Lecture Notes Series, Vol. 13. Somerville, MA, United States: International Press on behalf of the Ramanujan Mathematical Society (Mysore, India).

Ferrero, D., & Harary, F. (2009). On eccentricity sequences of connected graphs. AKCE International Journal of Graphs and Combinatorics, 6(3), 401–408. https://doi.org/10.1080/09728600.2009.12088902

Ferrero, D. (2009). A survey on path graphs connectedness. Journal of Combinatorial Mathematics and Combinatorial Computing, 69, 75–88.

Wang, J.-J., Ho, T.-Y., Ferrero, D., & Sung, T.-Y. (2008). Diameter variability of cycles and tori. Information Sciences, 178(14), 2960–2967. https://doi.org/10.1016/j.ins.2008.03.008

Ferrero, D. (2008). Product line sigraphs. In 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 7-9 May 2008,  Sydney, NSW, Australia. https://doi.org/10.1109/I-SPAN.2008.15

Ferrero, D. (2007). Some properties of superline digraphs. In IEEE Proceedings of  Fourth International Conference on Information Technology: New Generations (ITNG’07), 2-4 April 2007, Las Vegas, NV (pp. 1073–1076). IEEE Computer Society. https://doi.org/10.1109/ITNG.2007.183

Ferrero, D. (Ed.). (2005). Proceedings of CombinaTexas. Hindawi Publishing Corp.

Vasquez-Mireles, S., & Ferrero, D. (2005). Advanced mathematics research experiences for high school students. Texas College Mathematics Journal, 4, 1–12.

Durdan, S., Ferrero, D., & Harary, F. (2005). On the Evolution of Square-cell Animals. CHANCE, 18(3), 16–19. https://doi.org/10.1080/09332480.2005.10722729

Balbuena, C., Ferrero, D., & Marcote, X. (2005). Diameter vulnerability of line digraphs in terms of the girth. Networks, 45(2), 49–54. https://doi.org/10.1002/net.20049

Bagga, J., & Ferrero, D. (2005). The structure of super line graphs. In IEEE Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’05) 7-9 December 2005,  Las Vegas, NV. IEEE Computer Society. https://doi.org/10.1109/ISPAN.2005.84

Chung, H., Ferrero, D., Taylor, A., & Warshauer, J. (2004). Diameter of path graphs. Journal of Discrete Mathematical Sciences and Cryptography, 7(1), 49–54. https://doi.org/10.1080/09720529.2004.10697988

Balbuena, C., & Ferrero, D. (2003). Edge-connectivity and super edge-connectivity of P2 path graphs. Discrete Mathematics, 269(1–3), 13–20. https://doi.org/10.1016/S0012-365X(02)00828-2

Balbuena, C., Ferrero, D., Marcote, X., & Pelayo, I. (2003). Algebraic properties of line digraphs. Journal of Interconnection Networks, 4, 377–393. https://doi.org/10.1142/S0219265903000933

Ferrero, D., & Harary, F. (2003). Edge sums of deBruijn interconnection networks. International Journal of Computer Mathematics, 80(7), 819–124. https://doi.org/10.1080/0020716031000087159a

Ferrero, D. (2003). Connectivity of path graphs. Acta Mathematica Universitatis Comenianae, LXXII(1), 59–66.

Chi, C., Ferrero, D., Hallford, C., & Williams, R. (2002). On the edge sums of deBruijn graphs. Journal of Discrete Mathematical Sciences and Cryptography, 5(2), 105–117. https://doi.org/10.1080/09720529.2002.10697942

Ferrero, D. (2002). Edge Connectivity of Iterated P3 Path Graphs. Congressus Numerantium, 155, 33–47.

Ferrero, D., & Padró, C. (2002). Partial line directed hypergraphs. Networks, 39(2), 61–67. https://doi.org/10.1002/net.10013

Ferrero, D., & Padró, C. (2002). Connectivity and fault-tolerance of hyperdigraphs. Discrete Applied Mathematics, 117, 15–26. https://doi.org/10.1016/S0166-218X(00)00333-4

Ferrero, D. (2002). Fault Tolerance in Digraphs of Small Diameter (Vol. X, pp. 2–10). Winter Garden, FL, USA: International Institute of Informatics and Systemics (IIIS).

Ferrero, D., & Padró, C. (2001). New Bounds on the Diameter Vulnerability of Iterated Line Digraphs. Discrete Mathematics, 233(1–3), 103–113. https://doi.org/10.1016/S0012-365X(00)00230-2

Ferrero, D. (1999). A brief introduction to graphs. Montevideo, Uruguay: Centro de Publicaciones de la  Facultad de Ingenieria, Universidad de la República.

Ferrero, D., & Padró, C. (1999). Disjoint paths of bounded length in large generalized cycles. Discrete Mathematics, 197–198, 285–298. https://doi.org/10.1016/S0012-365X(99)90075-4

Ferrero, D. (1999). Introduction to interconnection network models. Publicaciones Matematicas Del Uruguay, 99/25.

Ferrero, D. (1999). Connectivity in Directed Hypergraphs. Information Technology, 637–641.

Ferrero, D. (1999). A Technique for the (d, s, N)-Bus Network Problem (in Proceedings. SCCC’99 XIX International Conference of the Chilean Computer Science Society) (pp. 129–135). IEEE Computer Society. https://doi.org/10.1109/SCCC.1999.810165

Ferrero, D. (1999). Maximally Connected Hyperdigraphs (pp. 62–64). János Bolyai Mathematical Society.

Gonzalo, R., Ferrero, D., & Soriano, M. (1998). Non-Linear Feedback Shift Registers with Maximum Period (in 6th International Conference on Telecommunication Systems Modeling and Analysis) (pp. 13–16).

Ferrero, D., Soriano, M., & Gonzalo, R. (1998). NLFSR de período máximo [in V Reunión Española de Criptología y Seguridad de la Información) (pp. 347–352).

Ferrero, D. (1997). Fault tolerant routings in large generalized cycles. In Proceedings 17th International Conference of the Chilean Computer Science Society, 10-15 November 1997 (Valparaiso, Chile) (pp. 58–65). IEEE Computer Society. https://doi.org/10.1109/SCCC.1997.636870

Ferrero, D. (1997). Non Linear Feedback Shift Registers over Zn (in: Research Conference on Algebra and Discrete Mathematics of the European Mathematical Society).