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

Path spectra
by
Guantao Chen
Dept. of Math. & Stat., Georgia State University

A path P of a graph G is called maximal if there are no paths containing P as a subpath. The path spectrum ps(G) is the set of lengths of all maximal paths of G. A set S of positive integers is called a path spectrum if there exists a connected graph G such that S=ps(G). We will discuss the existences of non-path spectrum sets, path spectra for dense graphs, and path spectra for trees.

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-47.