Michael Yatauro earned a B.A. in mathematics from Rutgers University, an M.A. in mathematics from the University of Pennsylvania, and a Ph.D. in mathematics from Stevens Institute of Technology. Dr. Yatauro views mathematics as a form of artistic expression and a scientific tool of great utility. His primary research is in the field of graph theory. In particular, he is interested in determining structural aspects of a graph by studying its degree sequence. Much of his work has focused on results concerning the toughness and binding number of a graph, the study of which lies at the heart of questions concerning significant aspects of graph theory (hamiltonicity, factors, cycle structure, etc.).
He also enjoys playing the drums. In recent years, he has performed with friends at a number of benefits to help raise money for cancer research.
Recent Publications and Presentations
M. Yatauro. Stability theorems for the binding number and tenacity of a graph. 30th Cumberland Conference on Combinatorics, Graph Theory, and Computing, Marshall University, Huntington, WV, May 2018.
M. Yatauro. The edge cover probability polynomial of a graph and optimal network construction, IEEE Trans. Network Sci. Eng., 2018, doi: 10.1109/TNSE.2018.2820062.
M. Yatauro. The edge cover reliability polynomial of a graph. 6th biennial Canadian Discrete and Algorithmic Mathematics Conference, Ryerson University, Toronto, Ontario, Canada, June 2017.
D. Gross, M. Heinig, J. Saccoman, C. Su_el, and M. Yatauro. On reliability models associated with the edge domination number for trees, Congr. Numer. 227 (2016), 65-83.
D. Bauer, H. J. Broersma, J. van den Heuvel, N. Kahl, A. Nevo, E. Schmeichel, D. R. Woodall, and M. Yatauro. Best monotone degree conditions for graph properties: A survey, Graphs Combin. 31 (2015), no. 1, 1-22.