The Blank School engages Babson community members and leads research to create entrepreneurial leaders.

Denise S. Troxell
- Associate Professor
Academic Division: Mathematics, Analytics, Science, and Technology
Bio
Academic Degrees
- Ph D, Rutgers University
- MS, Universidade de São Paulo, Brazil
- BS, Universidade de São Paulo, Brazil
Academic Interest / Expertise
Graph Theory; Discrete Mathematics; Combinatorics; Operations Research; Theoretical Computer Science; Mathematics/Business Analytics/Operations Research EducationAwards & Honors
Publications
Journal Articles
- Karst, N.J., Shen, X., Troxell, D.S., Vu, M. (2020). Blocking zero forcing processes in Cartesian products of graphs. Discrete Applied Mathematics. Vol: 285, Page: 380-398. Elsevier. link
- Beaudouin-Lafon, M., Chen, S., Crawford, M., Karst, N.J., Nielsen, L., Troxell, D.S. (2020). On the zero blocking number of rectangular, cylindrical, and Möbius grids. Discrete Applied Mathematics. Vol: 282, Page: 35-47. Elsevier. link
- Beaudouin-Lafon, M., Chen, S., Karst, N.J., Troxell, D.S., Zheng, X. (2019). Pairwise compatibility graphs: complete characterization for wheels. Involve: a journal of mathematics. Vol: 12, Issue: 5, Page: 871-882. link
- Beaudouin-Lafon, M., Chen, S., Karst, N.J., Troxell, D.S. (2018). Labeling crossed prisms with a condition at distance two. Involve: a journal of mathematics. Vol: 11, Issue: 1, Page: 67–80. link
- Karst, N.J., Langowitz, J., Oehrlein, J., Troxell, D.S. (2017). Radio k-Chromatic Number of Cycles for Large k. Discrete Mathematics, Algorithms and Applications. Vol: 09, Issue: 03. link
- Karst, N.J., Oehrlein, J., Troxell, D.S., Zhu, J. (2015). L(d,1)-labeling of the edge-path-replacement by factorization of graphs. Journal of Combinatorial Optimization. Vol: 30, Issue: 1, Page: 34-41. link
- Karst, N.J., Oehrlein, J., Troxell, D.S., Zhu, J. (2015). On distance labelings of amalgamations and injective labelings of general graphs. Involve: a journal of mathematics. Vol: 8, Issue: 3, Page: 535–540. Mathematical Sciences Publishers. link
- Karst, N.J., Oeherlein, J., Troxell, D.S., Zhu, J. (2015). The minimum span of L(2, 1)-labelings of generalized flowers. Discrete Applied Mathematics. Vol: 181, Page: 139–151. Elsevier. link
- Karst, N.J., Oehrlein, J., Troxell, D.S., Zhu, J. (2014). Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two. Discrete Applied Mathematics. Vol: 178, Issue: 11, Page: 101-108. Elsevier BV North-Holland. link
- Adams, S.S., Brass, Z., Stokes, C., Troxell, D.S. (2013). Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. Australasian Journal of Combinatorics. Vol: 56, Page: 47-60. Centre for Discrete Mathematics & Computing.
- Adams, S.S., Howell, N., Karst, N.J., Troxell, D.S., Zhu , J. (2013). On the L(2,1)-labelings of amalgamations of graphs. Discrete Applied Mathematics. Vol: 161, Issue: 7-8, Page: 881-888. Elsevier BV, North-Holland. link
- Adams, S.S., Booth, P., Jaffe, H., Troxell, D.S., Zinnen, S.L. (2012). Exact λ-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. Discrete Applied Mathematics. Vol: 160, Issue: 4-5, Page: 436-447. Elsevier BV, North-Holland.
- Adams, S.S., Booth, P., Troxell, D.S., Zinnen, S.L. (2012). Modeling the Spread of Fault in Majority Based Network Systems: dynamic monopolies in triangular grids. Discrete Applied Mathematics. Vol: 160, Issue: 10-11, Page: 1624-1633. Elsevier BV, North-Holland.
- Adams, S.S., Troxell, D.S., Zinnen, S.L. (2011). Dynamic monopolies and feedback vertex sets in hexagonal grids. Computers & Mathematics with Applications: an international journal. Issue: 62, Page: 4049-4057.
- Adams, S.S., Troxell, D.S. (2011). Labeling matched sums with a condition at distance two. Applied Mathematics Letters. Issue: 24, Page: 950-957.
- Adams, S.S., Westgate, B., Trazkovich, A., Troxell, D.S. (2010). On island sequences of labelings with a condition at distance two. Discrete Applied Mathematics. Issue: 158, Page: 1-7.
- Adams, S.S., Tesch, M., Troxell, D.S., Westgate, B., Wheeland, C. (2007). On the hole index of L(2,1)-labelings of r-regular graphs. Discrete Applied Mathematics. Issue: 155, Page: 2391—2393 .
- Adams, S.S., Cass, J., Tesch, M., Troxell, D.S., Wheeland, C. (2007). The minimum span of L(2,1)-labelings of certain Generalized Petersen graphs. Discrete Applied Mathematics. Issue: 155, Page: 1314—1325 .
- Adams, S.S., Cass, J., Troxell, D.S. (2006). An extension of the channel assignment problem: L(2,1)-labelings of Generalized Petersen graphs. IEEE Transactions on Circuits and Systems I. Issue: 53, Page: 1101—1107.
- Schwarz, C., Troxell, D.S. (2006). L(2,1)-labelings of the Cartesian products of two cycles. Discrete Applied Mathematics. Page: 1522—1540.
- Troxell, D.S. (2005). On critical trees labeled with a condition at distance two. Discrete Mathematics. Issue: 295, Page: 173—189.
- Troxell, D.S. (2003). A note on the representation of unit interval graphs: a link between interval graphs and semiorders. ARS Combinatoria. Issue: 66, Page: 121-128.
- Troxell, D.S. (2002). Optimization software pitfalls: raising awareness in the classroom. INFORMS Transactions on Education. Vol: 2, Issue: 2.
- Troxell, D.S. (1996). No-hole k-tuple (r+1)-distant colorings. Discrete Applied Mathematics. Issue: 64, Page: 67-86.
- Troxell, D.S. (1995). Minimizing the number of holes in 2-distant colorings. ARS Combinatoria. Issue: 41, Page: 77-86.
- Troxell, D.S. (1995). On properties of unit interval graphs with a perceptual motivation. Mathematical Social Sciences. Issue: 30, Page: 1-22.
- Sakai, D. (1994). Labelling chordal graphs: distance two condition. SIAM Journal of Discrete Mathematics. Issue: 7, Page: 133-140.
- Wang, C., Sakai, D. (1993). No-hole (r+1)-distant colorings. Discrete Mathematics. Issue: 119, Page: 175-189.