2009/03/11 by Chris Smith, Smith, Chris
Computer Science · Mathematics · #05C10 #05C50 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #math.CO #msc:05C10 #msc:05C50
paper · pdf · doi:10.48550/arxiv.0903.2000
6 pages
arxiv created 2009/03/11 · openalex publication_date 2009/03/11 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs.