Distance-regular graphs without 4-claws
Abstract
We determine the distance-regular graphs with diameter at least 3 and c2≥ 2 but without induced K1,4-subgraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.