Denise S. Troxell

Associate Professor

Academic Division: Math & Science
Babson
# 318
781-239-6309

Bio

Dr. Troxell’s current research interests focus on Graph Theory models of applications in telecommunications and in the spreads of (a) disease through populations, (b) opinion through social networks, and (c) faults in distributed computer networks. Her research and teaching interests also include Discrete Mathematics, Operations Research, Theoretical Computer Science, and Mathematics/Business Analytics/Operations Research Education. Dr. Troxell's publications have appeared in: SIAM Journal of Discrete Mathematics; Discrete Applied Mathematics; Discrete Mathematics; IEEE Transactions on Circuits and Systems I; Computers and Mathematics with Applications; Applied Mathematics Letters; Journal of Combinatorial Optimization; ARS Combinatoria; Australasian Journal of Combinatorics; Discrete Mathematics, Algorithms and Applications; Involve, A Journal of Mathematics; Mathematical Social Sciences; and Informs Transactions in Education. Prior to joining Babson, she held faculty positions at the Universidade de São Paulo (Brazil), Montclair State University (NJ), and the College of The Holy Cross (MA). She is a member of the American Mathematical Society (AMS), the Society for Industrial and Applied Mathematics (SIAM), and the Institute for Operations Research and Management Sciences (INFORMS).

Academic Degrees

  • Ph D, Rutgers University
  • MS, Universidade de São Paulo, Brazil
  • BS, Universidade de São Paulo, Brazil

Academic Interests

Graph Theory; Discrete Mathematics; Combinatorics; Operations Research; Theoretical Computer Science; Mathematics/Business Analytics/Operations Research Education

Awards & Honors

  • 2016 - Babson Research Scholar, Dean of Faculty
  • 2016 - BFRF Excellence in Scholarship Award, Babson Faculty Research Fund
  • 2014 - Babson Research Scholar, Dean of Faculty
  • 2013 - Deans' Award for Excellence in Teaching in the Undergraduate Program, Babson Deans
  • 2011 - Babson Research Scholar, Dean of Faculty

Courses

Degree Courses 2016-2017

  • QTM 2000: CASE STUDIES IN BUSINESS ANALYTICS
  • QTM 2601: APPLICATIONS OF DISCRETE MATH

Publications

Journal Articles

  • 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, 11(1), 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, 09(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, 30(1), 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, 8(3), 535–540. 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, 181, 139–151. 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, 178(11), 101-108. 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, 56, 47-60.
  • 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, 161(7-8), 881-888. 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, 160(4-5), 436-447.
  • 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, 160(10-11), 1624-1633.
  • 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(62), 4049-4057.
  • Adams, S.S., Troxell, D.S. (2011). Labeling matched sums with a condition at distance two. Applied Mathematics Letters(24), 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(158), 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(155), 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(155), 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(53), 1101—1107.
  • Schwarz, C., Troxell, D.S. (2006). L(2,1)-labelings of the Cartesian products of two cycles. Discrete Applied Mathematics, 1522—1540.
  • Troxell, D.S. (2005). On critical trees labeled with a condition at distance two. Discrete Mathematics(295), 173—189.
  • Troxell, D.S. (2003). A note on the representation of unit interval graphs: a link between interval graphs and semiorders. ARS Combinatoria(66), 121-128.
  • Troxell, D.S. (2002). Optimization software pitfalls: raising awareness in the classroom. INFORMS Transactions on Education, 2(2)
  • Troxell, D.S. (1996). No-hole k-tuple (r+1)-distant colorings. Discrete Applied Mathematics(64), 67-86.
  • Troxell, D.S. (1995). Minimizing the number of holes in 2-distant colorings. ARS Combinatoria(41), 77-86.
  • Troxell, D.S. (1995). On properties of unit interval graphs with a perceptual motivation. Mathematical Social Sciences(30), 1-22.
  • Sakai, D. (1994). Labelling chordal graphs: distance two condition. SIAM Journal of Discrete Mathematics(7), 133-140.
  • Wang, C., Sakai, D. (1993). No-hole (r+1)-distant colorings. Discrete Mathematics(119), 175-189.

Presentations

  • The minimum span of L(2,1)-labelings of generalized flowers
    Karst, N., Oehrlein, J., Troxell, D., Zhu, J. The minimum span of L(2,1)-labelings of generalized flowers 2016 Joint Mathematics Meetings, Seattle, WA (2016)
  • Distance labelings of amalgamations and injective labelings of general graphs
    Karst, N., Oehrlein, J., Troxell, D., Zhu, J. Distance labelings of amalgamations and injective labelings of general graphs 2015 Joint Mathematics Meetings, San Antonio, TX (2015)
  • L(d,1)-labelings of the edge-path-replacement by factorization of graphs
    Karst, N., Oehrlein, J., Troxell, D., Zhu, J. L(d,1)-labelings of the edge-path-replacement by factorization of graphs 2014 Joint Mathematics Meetings, Baltimore, MD (2014)
  • On the L(2,1)-labelings of amalgamations of graphs
    Adams, S., Howell, N., Karst, N., Troxell, D., Zhu, J. On the L(2,1)-labelings of amalgamations of graphs 2014 Joint Mathematics Meetings, Baltimore, MD (2014)