Invariants of Replacement Product Graphs

Jay Cummings, UNL

Meeting Time: April 26, 2011, 2:00-2:50pm, Avery 351

Abstract: The replacement product is a non-commutative graph product which has proven to be useful in many areas of mathematics. In this talk we will discuss bounds on invariants of graphs which are realizable as replacement product of two smaller graphs. In particular we will look at the independence, domination, total domination and connected domination numbers and edge-connectivity. We will also discuss classes of graphs which meet our bound.