Classifying strongly regular graphs using lexical ordering of adjacency matrices

DOI10.1016/0898-1221(91)90076-GMaRDI QIDQ757086zbMATH OpenOpenAlexFDO

Authors Kris Coolsaet, V. Fack

Publication date 1991

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(91)90076-g

zbMATH Keywords

strongly regular graphsclassification algorithmlexical ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Axiomatics of classical set theory and its fragments (03E30)

Recommendations

• scientific article; zbMATH DE number 4193150
• Doubly Lexical Orderings of Matrices
• Graphs represented by extended diagonal matrices
• Adjacency Matrices
• Extremal matrices for the Bruhat-graph order

Cites work

• scientific article; zbMATH DE number 3884175 (Why is no real title available?)
• scientific article; zbMATH DE number 3664952 (Why is no real title available?)
• scientific article; zbMATH DE number 3670480 (Why is no real title available?)
• An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• Strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs

Cited in

(1)

• scientific article; zbMATH DE number 4193150 (Why is no real title available?)

This page was built for publication: Classifying strongly regular graphs using lexical ordering of adjacency matrices

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