BEGIN:VCALENDAR
PRODID:-//Brown Bear Software//Calcium 4.01//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
SUMMARY:Department Seminar: Independent domination number of regular graphs\, Ilkyoo Choi\, Hankuk University of Foreign Studies\, Republic of\nKorea
UID:x-1718-Calcium@vm-mp1-int
DTSTAMP:20220925T160844Z
DTEND:20220601T231500Z
CATEGORIES:Department Seminar
ORGANIZER:MAILTO:Calcium@localhost.localdomain
DESCRIPTION:Title: Independent domination number of regular graphs\nSpeaker: Ilkyoo Choi\, Hankuk University of Foreign Studies\, Republic of\nKorea\n\nThe speaker will be remote on zoom. \n\nContact mathstats-staff@ucdenver.edu for Zoom info\n\nAbstract: The independent domination number of a graph $G$\, denoted $i(G)$\, is the minimum size of an independent dominating set of $G$. We recently proved a series of results regarding independent domination of regular graphs. One result is the following: Let $G$ be a connected $r$-regular graph that is not $K_{r\,r}$ where $r\\geq 3$. We prove that $i(G)\\leq \\frac{r-1}{2r-1}|V(G)|$\, which is tight for $r\\in\\{3\,4\\}$\, generalizing a result by Lam\, Shiu\, and Sun. This result also answers a question by Goddard et al. in the affirmative. Moreover\, if we restrict $G$ to be a $3$-regular graph without $4$-cycles\, then we prove that $i(G)\\leq \\frac{4}{11}|V(G)|$\, which improves a result by Abrishami and Henning. We also investigate independent domination for the class of graphs with bounded maximum degree. This talk is based on joint work with Eun-Kyung Cho\, Hyemin Kwon\, and Boram Park.\nSpeaker: : Ilkyoo Choi\nAffiliation: : Hankuk University of Foreign Studies\, Republic of Korea\nLocation: : ( virtual on zoom )
DTSTART:20220601T220000Z
END:VEVENT
END:VCALENDAR