BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Mathematical Sciences - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:/math
X-WR-CALDESC:Events for Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20230312T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20231105T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20240310T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20241103T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20250309T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20251102T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20241004T123000
DTEND;TZID=America/Chicago:20241004T133000
DTSTAMP:20260420T230525
CREATED:20240925T143928Z
LAST-MODIFIED:20240925T143928Z
UID:10016181-1728045000-1728048600@uwm.edu
SUMMARY:Graduate Student Colloquium: Jillian Cervantes
DESCRIPTION:(t\,r) Broadcast Domination of the Truncated Square Tiling Graph\nJillian Cervantes\nGraduate Student\nUniversity of Wisconsin – Milwaukee \nThis talk will introduce graph domination theory and a generalization called (t\,r) broadcast domination. We study a family of graphs that arise as a finite subgraph of the truncated square tiling\, which utilizes regular squares and octagons to tile the Euclidean plane. For positive integers m and n\, we let Hm\,n be the graph consisting of m rows of n octagons (cycle graph on 8 vertices). For all t ≥ 2\, we provide lower and upper bounds for the (t\, 1) broadcast domination number for Hm\,n for all m\, n ≥ 1. We give exact (2\, 1) broadcast domination numbers for Hm\,n when (m\, n) ∈ {(1\, 1)\, (1\, 2)\, (1\, 3)\, (1\, 4)\, (2\, 2)}. We also consider the infinite truncated square tiling\, and we provide constructions of infinite (t\, r) broadcasts for (t\, r) ∈ {(2\, 1)\, (2\, 2)\, (3\, 1)\, (3\, 2)\, (3\, 3)\, (4\, 1)}. Using these constructions we give upper bounds on the density of these broadcasts i.e.\, the proportion of vertices needed to (t\, r) broadcast dominate this infinite graph. We end with some directions for future study
URL:/math/event/graduate-student-colloquium-jillian-cervantes/
LOCATION:EMS Building\, Room E495\, E495; 3200 N Cramer St.\, Milwaukee\, WI\, 53211\, United States
CATEGORIES:Graduate Student Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
GEO:43.0758771;-87.8858312
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=EMS Building Room E495 E495; 3200 N Cramer St. Milwaukee WI 53211 United States;X-APPLE-RADIUS=500;X-TITLE=E495; 3200 N Cramer St.:geo:-87.8858312,43.0758771
END:VEVENT
END:VCALENDAR