Efficient dominating sets in Cayley graphs on abelian groups

Datum / Date: 8.10.18
Čas / Time: 10:00-11:00
Predavalnica / Location: FAMNIT-MP7 (formerly FAMNIT-POŠTA)
Predavatelj / Lecturer: Štefko Miklavič (University of Primorska)
Naslov / Title: Efficient dominating sets in Cayley graphs on abelian groups
Povzetek / Abstract:

An independent set D of vertices in a graph is an efficient dominating set when each vertex not in D is adjacent to exactly one vertex in D. In this talk we give a classification of cubic and quartic Cayley graphs on abelian groups, which admit efficient dominating set.

Joint work with Sibel Ozkan and Cafer Celiskan.

Share with others

Accessibility Toolbar

Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.