Maximal cocliques of a strongly regular graph with parameters (2048,276,44,36)
Abstract
This article considers a strongly regular graph with parameters (2048,276,44,36) that is related to the extended binary Golay code. That graph is known since about 1975 but there seems to be not much information on the contained maximal cocliques. The source package of this article contains a data file that encodes a sequence of maximal independence sets of that graph, covering all sizes from 20 to 67 and the size 72, and a Pascal program to check this assertion and to optionally generate a text file (to be read by the computer algebra system GAP) that contains the adjacency lists of that graph and the list of the independence sets.
Keywords
Cite
@article{arxiv.2107.06249,
title = {Maximal cocliques of a strongly regular graph with parameters (2048,276,44,36)},
author = {Thomas Jenrich},
journal= {arXiv preprint arXiv:2107.06249},
year = {2023}
}
Comments
5 pages, 2 additional files (program source and data file); v2: Description of the calculation of the number to structurally distinguish the two sets of size 72 corrected, optional data export instructions added to the computer program