| Name: | Lynne L. Doty |
| Title: | Professor of Mathematics |
| Office Location: | Lowell Thomas 114 |
| Extension: | (845) 575-3000 ext. 2611 |
| Email: | Lynne.Doty@Marist.edu |
| Degrees Held: | B.S. East Stroudsburg University M.A. State University College, New Paltz Ph.D. Stevens Institute of Technology |
| Bio: | Professor Doty has co-authored research articles with Frank Harary (thereby achieving Erdos number 2) and Derek Smith of the University of Glamorgan (Wales). During sabbatical leaves she worked at Simon Fraser University in Burnaby, British Columbia and with a collegue at Bloomburg University. She often teaches an introductory networks and graph theory course ( sometimes coupled with a college writing course) that seeks to embed mathematics in a larger intellectual and cultural context. |
| Interests: | Professor Doty's specialization is in discrete mathematics and combinatorics. Most of her research work has focused on establishing theoretical bounds describing the ability of a communication network to survive local failures. |
| Publications: | Buckley, F., L. L. Doty, and F. Harary. "On graphs with signed inverses." Networks. 18 (1988) 151-157. Doty, L. L. "Extremal connectivity and vulnerability in graphs." Networks. 19 (1989) 73-78. Smith, Derek H. and L. L. Doty. "On the construction of optimally reliable graphs." Networks. 20 (1990) 723-729. Doty, L. L. "A large class of maximally tough graphs." OR-Spektrum. 13 (1991) 147-151. Doty, L. L. "Real mathematics for non-majors." PRIMUS. 5 (1995) 205- 217. Doty, L. L., R. J. Goldstone, and C. L. Suffel. "Cayley graphs with neighbor-connectivity one." SIAM J. Discrete Mathematics. 9 (1996) 625-642. Saunders, Judith P. and Lynne L. Doty. "Scholarship Further Reconsidered: A Modest Proposal for Extending Boyers Model." Journal of Irreproducible Results 42.6 (1997) 4-5. Baldwin-McGrail, Tracey, K. Peter Krog, and Lynne. L. Doty. "Probability and Chip Firing Games." Published electronically by DIMACS-Rutgers 2004. Module number 04-1 http://dimacs.rutgers.edu/Publications/Modules/moduleslist.html Doty, Lynne L. and Kevin K. Ferland. "Maximally tough cubic graphs." Congressus Numerantium. 161 (2003) 75-96. Doty, Lynne L. and Kevin K. Ferland. "Super-tough graphs need not be $K_{1,3}$-free." Australasian Journal of Combinatorics. 32 (2005) 91-103. Doty, Lynne L. "A new bound for neighbor-connectivity of abelian Cayley graphs." Discrete Mathematics. 306 (2006) 1301-1316. Doty, Lynne L. and Kevin K. Ferland. "Some maximally tough circulants" Ars Combinatoria. 87 (2008) 193-203. Doty, Lynne L. and Kevin K. Ferland. Supertough 5-regular graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 64 (2008), 97-108. |
| Affiliations: | Mathematics Association of America Society for Industrial and Applied Mathematics American Association of University Professors |
