| Abstract |
Graph theory, graph algorithms and their applications form one of the fastest growing areas of research. Applications of graph theory in games, tournaments and social networks have long been studied. Indeed, the commonly accepted first paper in graph theory by Leonhard Euler (1736) solved the famous Königsberg Bridges Problem, and Paul Erdös proposed a variation of this problem as an achievement game in Harary’s terminology (1987) of achievement and avoidance games. Tournaments are directed graph models of outcomes of games or paired comparisons. More recently, the study of social networks has gained increased prominence due to its applications in the investigation of massive graphs such as those modeling the World Wide Web.
Frank Harary published extensively in all of the areas mentioned above. Bagga, Beineke and Harary studied coloring problems in tournaments. Bagga investigated several properties of bipartite tournaments.
We will discuss the impact of Harary’s contributions in these and related areas.
|
| Bio |
Dr. Jay S. Bagga holds a Ph.D. in Mathematics (Purdue University) and an M.S. in Computer Science (Ball State University). Earlier degrees include an M.S. in Mathematics (Purdue University) and a B. Sc. in Mathematics and Physics (University of Bombay). He works in the areas of Graph Theory, Graph Algorithms and their applications, to solve problems in Computer Science, Computational Geometry, Bioinformatics, Software Verification and Model Checking, Software tools for Graph Theory, and other related fields.
Bagga has published over fifty research papers. His research has been funded by significant grants from federal, state and private agencies, and universities, including those from the Office of Naval Research, Department of Education and State of Indiana.
Bagga has won several honors and awards. In 2000 he received a U.S. Department of State Fulbright Senior Scholar Award and spent a year as a Fulbright Visiting Professor at University of Zimbabwe. In 2002, Bagga won the Outstanding Researcher Award at Ball State University. In 2006, Bagga was honored as the Harary Lecturer at the MIGHTY XLIII (Midwest Graph Theory) Conference held at Indiana-Purdue University at Fort Wayne.
Bagga joined Ball State University in 1989 and he served as the Chair of the Department of Computer Science during 2003-06. Prior to that, Bagga served as Assistant Professor and as Associate Professor at Indiana-Purdue University at Fort Wayne. He has also held visiting positions at Texas State University at San Marcos and at University of Zimbabwe. He has co-organized several national and international conferences and workshops in Graph theory and Software Verification Techniques, including those in India, the U.S. and Zimbabwe. He has served as co-editor of several international conference proceedings and a referee for many journals. He has also served on panels of reviewers for National Science Foundation (NSF) and Council for International Exchange of Scholars (CIES) Fulbright Awards. Bagga directs international exchange programs between Ball State University and educational/research institutions in India and China.
|
