Induced paths in strongly regular graphs
Combinatorics
2023-07-28 v1
Abstract
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path 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 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.
Keywords
Cite
@article{arxiv.2307.14493,
title = {Induced paths in strongly regular graphs},
author = {Robert F. Bailey and Abigail K. Rowsell},
journal= {arXiv preprint arXiv:2307.14493},
year = {2023}
}
Comments
10 pages