Strongly regular graphs and designs with three intersection numbers

DOI10.1023/A:1008387611396MaRDI QIDQ5926317zbMATH OpenOpenAlexFDO

Authors Yury J. Ionin, Shirikhande, M. S.

Publication date 13 May 2001

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008387611396

zbMATH Keywords

association schemestrongly regular graphsintersection numbers2-design\(\alpha\)-resolvable designsnearly affine decomposition

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30)

Recommendations

• scientific article; zbMATH DE number 26308
• On 3‐regular graphs having crossing number at least 2
• Strongly regular tri-Cayley graphs
• On strongly regular graphs with eigenvalue 3 and their extensions
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
• On triple systems and strongly regular graphs
• On 2-(n^2, 2n, 2n-1) designs with three intersection numbers
• The strong intersecting number of a graph
• Triple intersection numbers of Q-polynomial distance-regular graphs
• Construction of strongly regular graphs using affine designs

Cited in

(7)

• Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
• On the structure of 1-designs with at most two block intersection numbers
• 5-designs with three intersection numbers
• Remarks on minimal semi-symmetric 3-designs with a null polarity and their associated strongly regular graphs
• Decomposable symmetric designs
• scientific article; zbMATH DE number 26308 (Why is no real title available?)
• On 2-(n^2, 2n, 2n-1) designs with three intersection numbers

This page was built for publication: Strongly regular graphs and designs with three intersection numbers

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