معرفی
Professor Daniel Pritikin is an academic in the Department of Mathematics at Miami University. He holds a Ph.D. in Mathematics from the University of Wisconsin. His research focuses on Graph Theory, Combinatorics, and Recreational Mathematics, with notable contributions to Hamiltonian cycles in multipartite graphs, Steiner tree problems in hypercubes, and combinatorial game theory. His work bridges theoretical graph structures with algorithmic applications and playful mathematical explorations.
Key research themes include graph embeddings, combinatorial optimization, and algebraic graph theory, often intersecting with geometric and number-theoretic concepts. Recent studies explore hypercube networks, Cayley graph representations, and the interplay between graph parameters like separation numbers and domination. His articles frequently address structural properties of graphs and their applications in network design and puzzle-solving.
While no specific scientific awards are listed, his prolific publication record since 1985 underscores sustained academic engagement. His advising record is not detailed here, but his research spans over three decades, including foundational work on unitary Cayley graphs and Steiner tree optimizations.
