Distance-regular graphs without 4-claws
arXiv:1706.06036
Abstract
We determine the distance-regular graphs with diameter at least and but without induced -subgraphs.
arXiv:1706.06036
We determine the distance-regular graphs with diameter at least and but without induced -subgraphs.