Abstract
AbstractA path of a graph is called maximal if it is not a proper subpath of any other path of the graph. The path spectrum of a graph G, denoted by ps(G), is the set of lengths of all maximal paths in the graph. A set S of positive integers is called a path spectrum if there is a connected graph G such that ps(G) = S. Jacobson et al. showed that all sets of positive integers with cardinality of 1 or 2 are path spectrum sets. Their results raised the question of whether all sets of positive integers are path spectra. We show that, for every positive integer k ≥ 3, there are infinitely many sets of k positive integers which are not path spectra. A set S of positive integers is called an absolute path spectrum if there are infinitely many connected graphs G such that ps(G) = S. We completely characterize absolute path spectra S for |S| ≤ 2. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 329–350, 2008
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
