Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}

zbMath1436.05142MaRDI QIDQ2306451

Janoš Vidali

Publication date: 23 March 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2019//105.html

zbMATH Keywords

association schemesdistance-regular graphssymbolic computationtriple intersection numbersKrein parameters

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

sage-drg

Uses Software

• Maxima
• SageMath
• Cbc
• GLPK
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• New families of \(Q\)-polynomial association schemes
• Imprimitive cometric association schemes: constructions and analysis
• Double covers of symplectic dual polar graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Commutative association schemes
• Linked systems of symmetric designs
• Using symbolic computation to prove nonexistence of distance-regular graphs
• Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems

This page was built for publication: Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}