Math Modeling Seminar: Minimum spectral radius in a given class of graphs
Math Modeling Seminar
Minimum spectral radius in a given class of graphs
Zoom Link here
Dr. Vishal Gupta
Visiting Assistant Professor, Department of Mathematics
University of Rochester
Abstract: In 1986, Brualdi and Solheid posed the question of determining the maximum and minimum spectral radius of a graph within a given class of simple graphs. Since then, this problem has been extensively studied for various graph classes. In this talk, I will discuss two such classes: simple connected graphs with a given order and size, and simple connected graphs with a given order and dissociation number. This presentation is based on joint work with Sebastian Cioaba, Dheer Noal Desai, and Celso Marques.
Bio: Vishal Gupta is a Visiting Assistant Professor in the Department of Mathematics at the University of Rochester. He obtained his BS-MS degree in Mathematics from the Indian Institute of Science Education and Research (IISER) Bhopal, followed by an MS in Data Science and a PhD in Mathematics from the University of Delaware. His research interests primarily lie in combinatorics and graph theory, particularly the problems in the spectral and extremal graph theory.
Intended Audience: Beginners, undergraduates, graduates. Those with interest in the topic.
Interpreters have been requested.
Event Snapshot
When and Where
Who
This is an RIT Only Event
Interpreter Requested?
Yes