The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
From MaRDI portal
Publication:2364627
DOI10.1007/s10623-016-0223-6zbMath1367.05060arXiv1512.05976OpenAlexW2204442158WikidataQ59614110 ScholiaQ59614110MaRDI QIDQ2364627
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05976
Software, source code, etc. for problems pertaining to algebraic topology (55-04) Distance in graphs (05C12) Combinatorial aspects of simplicial complexes (05E45)
Related Items
The \(\mathrm {L}_3(4)\) near octagon, Inverse problems in the class of distance-regular graphs of diameter 4
Uses Software
Cites Work
- Distance-regular graphs
- Strongly regular graphs having strongly regular subconstituents
- Distance regular covers of the complete graph
- On vector enumeration
- Three new distance-regular graphs
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes
- Practical graph isomorphism. II.
- Classification of some strongly regular subgraphs of the McLaughlin graph
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Antipodal covering graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item