DisCoMath Seminar: On the π-attack Roman Dominating Number of a Graph and the use of End-Connected Center-Disjoint P5 subgraphs
DisCoMath Seminar
On the π-attack Roman Dominating Number of a Graph and the use of End-Connected Center-Disjoint P5 subgraphs
Garrison Koch
Rochester Institute of Technology
Abstract:
The Roman Dominating number is a widely studied variant of the dominating number on graphs. Given a graph πΊ=(π,πΈ), the dominating number of a graph is the minimum size of a vertex set, πβ²βπ, so that every vertex in the graph is either in πβ² or is adjacent to a vertex in πβ². The Roman Dominating function of πΊ is defined as π:πβ{0,1,2} such that every vertex with a label of 0 in πΊ is adjacent to a vertex with a label of 2. The Roman Dominating number of a graph is the minimum total weight over all possible Roman Dominating functions. In this talk we analyze a new variant: π-attack Roman Domination, particularly focusing on 2-attack Roman Domination (π=2). The π-attack Roman Dominating function of πΊ is defined similarly to the Roman Dominating function with the additional condition that for any πβ€π, any subset π of π vertices all with label 0, must have at least π vertices with label 2 in the open neighborhood of π. The π-attack Roman Dominating number is the minimum total weight over all possible π-attack Roman Dominating functions. We introduce a method for finding the 2RD number of a graph. We touch on extensions such as infinite regular graphs and "finite resources". We conclude with open questions and possible ways to extend these results to the general π-attack case.
Keep up with DisCoMath Seminars on the DisCoMathS webpage.
Intended Audience:
All are welcome.
To request an interpreter, please visit myaccess.rit.edu
Event Contact: Brendan Rooney | brsma@rit.edu
Event Snapshot
When and Where
Who
Open to the Public
Interpreter Requested?
No