Classifying strongly regular graphs using lexical ordering of adjacency matrices

DOI10.1016/0898-1221(91)90076-GzbMATH Open0723.68081OpenAlexW2082959682MaRDI QIDQ757086FDOQ757086

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

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

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)

Cites Work

• Title not available (Why is that?)
• Strongly regular graphs
• 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
• Title not available (Why is that?)
• Strongly regular graphs, partial geometries and partially balanced designs
• Title not available (Why is that?)
• An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices

Cited In (1)

• Title not available (Why is that?)

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)