More balancing for distance-regular graphs

DOI10.1016/J.EJC.2012.09.002MaRDI QIDQ691577zbMATH OpenOpenAlexFDO

Authors Jernej Tonejc

Publication date 3 December 2012

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2012.09.002

zbMATH Keywords

cosine sequencedistance regular graphsintersection arrayKrein parametersminimal idempotentstongly regular graphsstrongly balanced graphs

Mathematics Subject Classification ID

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

Recommendations

• A new inequality for distance-regular graphs
• On the primitive idempotents of distance-regular graphs
• An inequality on the cosines of a tight distance-regular graph
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

Cited in

(4)

• A new inequality for distance-regular graphs
• Cycle-balance conditions for distance-regular graphs
• On the Koolen-Park inequality and Terwilliger graphs
• An inequality on the cosines of a tight distance-regular graph

This page was built for publication: More balancing for distance-regular graphs

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