19-25 June 2011
Bled, Slovenia
Europe/Ljubljana timezone
Home > Timetable > Contribution details

On the Roman domination in the lexicographic product graphs

Presented by Polona PAVLIč
Type: Oral presentation
Track: Domination, Independence and Coloring of Product Graphs


A Roman domination function of a graph is a function f: V ---> {0,1,2} such that every vertex with f(v)=0 is adjacent to some vertex with f(v)=2. The Roman domination number is then the minimum of w(f)=\sum_{v \in V}f(v) over all such functions. We give the Roman domination number of the lexicographic product of graphs using a new concept of the so-called dominating pairs and introduce some new classes of Roman graphs.


Location: Bled, Slovenia
Address: Best Western Hotel Kompas Bled

Primary authors