Classification of Ryser graphs

DOI10.1134/S0001434609070037zbMATH Open1172.05352MaRDI QIDQ736200FDOQ736200

Authors: Alexander L. Gavrilyuk 

Publication date: 27 October 2009

Published in: Mathematical Notes (Search for Journal in Brave)

Recommendations

• Graph classes and Ramsey numbers
• scientific article; zbMATH DE number 3991552
• Classification of path-recursive graphs
• The Classification of Finitely Spreading Graphs
• scientific article; zbMATH DE number 3672341
• Classification of Cayley Rose window graphs
• Graph classes with linear Ramsey numbers
• Classifying a family of symmetric graphs
• The classi cation of rings with its genus of class of graphs
• The Homomorphism Structure of Classes of Graphs

zbMATH Keywords

strongly regular graphdistance-regular graphmultipartite graphRyser graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Distance-regularised graphs are distance-regular or distance-biregular
• Title not available (Why is that?)
• A generalization of the matrix equation \(A^ 2=J\)
• Every \((2,r)\)-regular graph is regular

Cited In (2)

• Title not available (Why is that?)
• Every \((2,r)\)-regular graph is regular

This page was built for publication: Classification of Ryser graphs

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