Atlas home || Conferences | Abstracts | about Atlas

22nd Cumberland Conference on Combinatorics, Graph Theory and Computing
May 21-23, 2009
Western Kentucky University
Bowling Green, KY, USA

Organizers
Bela Csaba, Chair; Mustafa Atici; Robert Crawford; Claus Ernst; Dominic Lanphier; Attila Por

View Abstracts
Conference Homepage

Asymptotic bounds on the integrity of graphs that have separator theorems
by
C. Ernst
WKU
Coauthors: D. Benko, D. Lanphier

In this talk we study the integrity of certain graph families. These include planar graphs, graphs with a given genus, graphs on the d-dimensional integer lattice Zd, and graphs that have no Kh-minor. We give upper bounds for the integrity in terms of the order n of the graph. We also give lower bounds for box-graphs in Zd. As a consequence, the integrity of planar graphs is on the order of n2/3 where 2/3 is the best possible exponent.

Date received: April 29, 2009

Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-48.