<p>We study maximal cliques in the collinearity graphs of Desarguesian nets, give some structural results and some numerical information. In particular, we show for Desarguesian nets that the set consisting of a point <i>x</i> together with all its neighbors on a line <i>L</i> (with <i>x</i> not on <i>L</i>) is contained in a unique maximal clique <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(C_{x,L}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>C</mi> <mrow> <mi>x</mi> <mo>,</mo> <mi>L</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> and determine the sizes and automorphism groups of such maximal cliques <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(C_{x,L}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>C</mi> <mrow> <mi>x</mi> <mo>,</mo> <mi>L</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> in all cases.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Cliques in Paley graphs of square order and in Peisert graphs

  • Andries E. Brouwer,
  • Sergey Goryainov,
  • Leonid Shalaginov,
  • Chi Hoi Yip

摘要

We study maximal cliques in the collinearity graphs of Desarguesian nets, give some structural results and some numerical information. In particular, we show for Desarguesian nets that the set consisting of a point x together with all its neighbors on a line L (with x not on L) is contained in a unique maximal clique \(C_{x,L}\) C x , L and determine the sizes and automorphism groups of such maximal cliques \(C_{x,L}\) C x , L in all cases.