Calendar

Thursday, June 15
Mathematics Colloquium
11:00 AM - 12:00 PM
Location: Science Center Room 323
Cost: Free

Speaker:  Rabab Alzahrani

Advisor: Atif Abueida

Title: Decomposition of Various Complete Graph into Isomophic Copies of 4-cycle with Three Pendant Edges

Abstract: An H-decomposition of a graph G is a partition of the edges of G into copies isomorphic to H.  When the decomposition is not feasible, one looks for the best possible by minimizing; the number of unused edges (leave of a packing), or the number of reused edges (padding of a covering).  We consider the H-decomposition, packing, and covering of the complete graphs and complete bipartite graphs, where H is a 4-cycle with three pendant edges.

All are invited to attend. 

Contact Information:
Name: Paul Eloe
Email: peloe1@udayton.edu