Total Roman Domination of Kneser Graphs

Authors

Isabella Asplund-Wain, Gonzaga University
Grace Dojan, Gonzaga University
Kathryn Ikard, Gonzaga University
Benjamin Nored, Gonzaga University
Katharine Shultis, Gonzaga UniversityFollow
Cole Stainsby, Gonzaga University
Hays Whitlatch, Gonzaga UniversityFollow

Document Type

Poster

Abstract

The total Roman domination number of a graph is the smallest possible sum of the weights 0, 1, and 2 applied to vertices of the graph that satisfy certain rules originating from Roman military strategy. In this poster, we discuss total Roman domination of Kneser graphs. We give exact counts for some graphs and demonstrate bounds for other graphs.

html

Publication Date

2023

Keywords

Kneser graphs, Roman domination number, Roman military strategy

Disciplines

Mathematics

Comments

For additional information about the equations featured in this poster, please reach out to the author.

Recommended Citation

Asplund-Wain, Isabella; Dojan, Grace; Ikard, Kathryn; Nored, Benjamin; Shultis, Katharine; Stainsby, Cole; and Whitlatch, Hays, "Total Roman Domination of Kneser Graphs" (2023). Math Student Scholarship. 22.
https://repository.gonzaga.edu/mathstudentschol/22

Upload File

wf_yes