On distance-regular graphs without 4-claws

DOI10.1134/S1064562413060057MaRDI QIDQ403859zbMATH OpenOpenAlexFDO

Authors Wenbin Guo, Alexandre A. Makhnev

Publication date 29 August 2014

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064562413060057

zbMATH Keywords

undirected graphsTerwilliger graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Recommendations

• On the geometricity of distance-regular graphs without 4-claws
• Geometric distance-regular graphs without 4-claws
• The Koolen-Park boundary and distance-regular graphs without \(m\)-claws
• Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Determination of the distance-regular graphs without 3-claws
• Geometric distance-regular graphs without 4-claws
• Shilla distance-regular graphs

Cited in

(2)

• On the geometricity of distance-regular graphs without 4-claws
• On the structure of graphs without claw, \(4K_1\) and co-R

This page was built for publication: On distance-regular graphs without 4-claws

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403859)