SEMINAR: Recent Results on Domination and Matching Theory in Graphs

SEMINAR: Recent Results on Domination and Matching Theory in Graphs



Speaker: Didem Gözüpek

Title: Recent Results on Domination and Matching Theory in Graphs

Date/Time: November 28, 2018 / 13:40 - 14:30

Place: FENS L030

Abstract: A dominating set in a graph is a subset of vertices such that the union of their closed neighborhood is the entire vertex set of the graph, while a matching is a subset of pair-wise disjoint edges. A graph is equimatchable if all of its maximal matchings have the same size. In this talk, I will present some recent results on equimatchable graphs such as forbidden subgraphs, stable equimatchable graphs, and the characterization of claw-free equimatchable graphs. I will then present some recent results on domination in graphs. Finally, I will discuss about new research directions in both topics.

Bio: Didem Gözüpek received her BS degree in Telecommunications Engineering from Sabancı University in 2004, her MS degree in Electrical Engineering from New Jersey Institute of Technology in 2005, and her PhD degree in Computer Engineering from Boğaziçi University in 2012. She worked as an R&D engineer for Argela Technologies between 2005 and 2008. Currently, she is an Associate Professor in the Computer Engineering Department and Vice Dean for Research in the Faculty of Engineering of Gebze Technical University. Her current research interests include structural and algorithmic graph theory, approximation algorithms, and optimization problems in communication networks. She received the Dr.Serhat Özyar Young Scientist of the Year Honorary Award in 2013, the Boğaziçi University PhD Thesis Award in 2012, and the Aselsan PhD Fellowship in 2011. She was a Finalist for the Google Anita Borg Memorial Scholarship in 2009..

Contact: Öznur Taştan& Semih Onur Sezer& Erdinç Öztürk