2023/07/26 by R. A. Bailey, Bailey, Robert F., Abigail K. Rowsell +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2307.14493
openalex publication_date 2023/07/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path P4 as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite graph nor its complement. Also, we investigate when a strongly regular graph has an induced subgraph isomorphic to P5 or its complement, considering several well-known families including Johnson and Kneser graphs, Hamming graphs, Latin square graphs, and block-intersection graphs of Steiner triple systems.