|
Ralucca Gera
Dept. of Mathematics, NPS
1500-1550 2/21/2008, Glasgow East-117
Abstract: Discrete structures can be studied from a graph theoretical point of view: a graph has vertices (representing a set of objects) and edges between vertices (representing a binary relationship between those objects). One of the current well researched areas in graph theory is the topic of domination. Standard domination applications include finding optimal locations of ATMs, police stations, antennas/towers, troop placements, etc. In this presentation, we survey a few domination variants. We present results on secure and dynamic domination, and also a proof of the NP-completeness of the associated decision problem for dynamic domination.
Speaker Bio: Ralucca Gera received her B.S. in Mathematics (2000), M.A. in Math (2002), and PhD also in Math (2005), all from Western Michigan University. She is an Assistant Professor in the Applied Mathematics Department at NPS since 2005. Dr. Gera’s research interests are combinatorial structures most of her publications being in graph theory, the study of mathematical structures that model pair wise relations between objects from a set. Her graph theoretical interests concerning counting and optimization type of questions are in distance, domination and alliances in graphs, with some emphasis on the maximum independent and minim clique problems. She has recently teamed with the NLP team at NPS.
View the flyer here.
|
