BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1523
DTSTAMP:20250123T084533Z
SUMMARY:Roman {3}-Domination on Chain Graphs and Cographs
DESCRIPTION:Speaker: Juhi Chaudhary (TIFR)\n\nAbstract: \nA function f : 
 V(G) → {0\, 1\, 2} is a Roman dominating function on G if for every v
 ertex v with f (v) = 0\, there exists a vertex u ∈ N(v) such that
  f (u) = 2. In the literature\, numerous variants of Roman domination ex
 ist\, each corresponding to a specific defense strategy\, and Roman {3}-d
 omination is one such variant.\nA Roman {3}-dominating function on a graph
  G is a function f : V (G) → {0\, 1\, 2\, 3} having the property that fo
 r any vertex u ∈ V (G)\, if f (u) = 0\, then ∑v∈N(u)​f(v)≥3\, a
 nd if f (u) = 1\, then ∑v∈N(u)​f(v)≥2. The weight of a Roman {3}-
 dominating function f is the sum f(V(G))=∑v∈V(G)​f(v) and the mini
 mum weight of a Roman {3}-dominating function on G is called the Roman {3
 }-domination number of G and is denoted by γ_{R3}(G). \nGiven a graph G
 \, Roman {3}-domination asks to find the minimum weight of a Roman {3}-dom
 inating functionon G.  In this talk\, we will explore linear-time algorit
 hms for solving the Roman {3}-Domination problem on chain graphs and cogra
 phs.\np.s. This talk is based on the following paper   https://www.scien
 cedirect.com/science/article/abs/pii/S0166218X22003651\n
URL:https://www.tcs.tifr.res.in/web/events/1523
DTSTART;TZID=Asia/Kolkata:20250124T160000
DTEND;TZID=Asia/Kolkata:20250124T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR