Published on:

8 February 2024

Primary Category:

Combinatorics

Paper Authors:

Mariusz Kwiatkowski,

Andrzej Matraś,

Mark Pankov,

Adam Tyc

•

There are two types of maximal cliques in the graph studied

•

Cliques of the same type can be mapped to each other for 5-ary codes

•

This uses properties of the inversion transform on the code's field

•

Additional examples are given for codes over fields of sizes 7 and 11

Cliques in 5-ary Simplex Codes

This paper studies maximal cliques, which are complete subgraphs, in the graph formed by 5-ary simplex codes of dimension 2. It finds that there are two types of maximal cliques - stars and tops. For cliques of the same type, there are transformations that map one to the other. Examples for codes over larger fields finish the paper.

Unlocking the Secrets of Maximal Cliques in Paley Graphs

Uncovering hidden structures: A guide to cliques in Paley-type graphs

On dense point-line arrangements in 3D

Accelerating maximal clique search via graph reduction

Forbidden subgraphs of co-maximal subgroup graphs

Finding large cliques in sparse graphs

No comments yet, be the first to start the conversation...

Sign up to comment on this paper