|
Organizers |
Some Hamiltonian Properties of L1 – Graphs
by
Rao Li
University of South Carolina Aiken
A graph G is called an L1 – graph if, for each triple of vertices u, v, and w with d(u, v) = 2 and w in N(u) ∩ N(v), d(u) + d(v) ≥ |N(u) U N(v) U N(w)| - 1. Some results on the Hamiltonian properties of L1 – graphs will be presented.
Date received: March 20, 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 # caxa-19.