2-walk-regular dihedrants from group-divisible designs

zbMath1339.05098arXiv1504.00449MaRDI QIDQ2629493

Jack H. Koolen, Shao-Fei Du, Zhi Qiao

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00449

zbMATH Keywords

association schemesdistance-regular graphs2-walk-regular graphs2-arc-transitive dihedrantsgroup divisible designs with the dual propertyrelative cyclic difference sets

Mathematics Subject Classification ID

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

Related Items (10)

FINITE TWO-DISTANCE-TRANSITIVE DIHEDRANTS ⋮ On association schemes generated by a relation or an idempotent ⋮ Two-arc-transitive bicirculants ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ Two-distance-primitive graphs ⋮ 2-walk-regular graphs with a small number of vertices compared to the valency ⋮ Partially metric association schemes with a multiplicity three ⋮ On 2-walk-regular graphs with a large intersection number \(c_2\) ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ On classification of 2-arc transitive Cayley graphs of the dicyclic group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing \((\ell ,m)\)-walk-regular graphs
• Spectra of graphs
• Quotient-polynomial graphs
• Classification of 2-arc-transitive dihedrants
• On \(2\)-arc-transitive covers of complete graphs
• The solution of the Waterloo problem
• Divisible design graphs
• On almost distance-regular graphs
• A classification of semisymmetric graphs of order 2pq
• Relative difference sets
• Cyclic relative difference sets with classical parameters

This page was built for publication: 2-walk-regular dihedrants from group-divisible designs