Classifying strongly regular graphs using lexical ordering of adjacency matrices
From MaRDI portal
Publication:757086
DOI10.1016/0898-1221(91)90076-GzbMath0723.68081OpenAlexW2082959682MaRDI QIDQ757086
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
Graph theory (including graph drawing) in computer science (68R10) Axiomatics of classical set theory and its fragments (03E30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Strongly regular graphs, partial geometries and partially balanced designs
- An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices
This page was built for publication: Classifying strongly regular graphs using lexical ordering of adjacency matrices