Distance-regular graphs without 4-claws
classification
🧮 math.CO
keywords
distance-regulargraphswithoutclawsdeterminediameterinducedleast
read the original abstract
We determine the distance-regular graphs with diameter at least $3$ and $c_2\geq 2$ but without induced $K_{1,4}$-subgraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.