|
Organizers |
Degree sum condition and Z3-connectivity
by
Rui Xu
University of West Georgia
Coauthors: Hong-Jian Lai (West Virginia University)
Yehong Shao (Ohio University Southern Campus)
Mingquan Zhan (Millersville University of Pennsylvania)
Let G be a simple graph on n vertices with d(G) ≥ 2. We prove that if dG(x)+dG(y) ≥ n for each xy ∈ E(G), then G is Z3-connected if and only if G is not one of the 17 completed described graphs.
Date received: February 28, 2008
Copyright © 2008 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 # cawn-08.