Eternal Paired Domination in Trees

Simple item page
dc.contributor.authorMoss, Elena
dc.date.accessioned2022-06-29T16:29:29Z
dc.date.available2022-06-29T16:29:29Z
dc.date.copyright2022en_US
dc.date.issued2022-06-29
dc.description.abstractThere are a wide variety of problems in graph domination. We discuss eternal paired domination in trees, a variation which requires guards stationed at the vertices of a dominating set to be able to defend against any sequence of attacks, while the guards remain adjacent to a “buddy” at all times. We have found an algorithm to obtain such a decomposition and proved that it is minimum. The eternal paired domination number of any non-trivial tree T is 2γ(T), where γ(T) is the domination number of T. Finally, we provide a counterexample in split graphs to demonstrate that this strategy cannot generalize to all chordal graphs.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelUndergraduateen_US
dc.description.sponsorshipJamie Cassels Undergraduate Research Awards (JCURA)en_US
dc.identifier.urihttp://hdl.handle.net/1828/14003
dc.language.isoenen_US
dc.subjectgraph theory
dc.subjecteternal domination
dc.subjectdynamic dominating sets
dc.subjecttrees
dc.subjectstars
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleEternal Paired Domination in Treesen_US
dc.typePosteren_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Moss_Elena_JCURA_2022.pdf
Size:
100.93 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Jamie Cassels Undergraduate Research Awards (JCURA)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.