参数为（2048，276，44，36）的强正则图的极大角点
Maximal cocliques of a strongly regular graph with parameters (2048,276,44,36)
摘要：
本文考虑了一个参数为（2048，276，44，36）的强正则图，它与扩展的二进制Golay码有关.该图自1975年以来一直是已知的，但似乎没有太多关于所包含的最大cocliques的信息。本文的源代码包包含一个数据文件，它编码了该图的最大独立集序列，涵盖了从20到67和72的所有大小，以及一个Pascal程序，用于检查此断言并可选地生成一个文本文件（由计算机代数系统GAP读取），其中包含该图的邻接列表和独立集列表。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
