Skip to content

Author

Laurent Bitjoka

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

The Cayley Completion of a Graph

A finite connected graph is rarely a Cayley graph. We measure how far it is from being one: given $G$ with $n$ vertices and $m$ edges, how few edges must be added, or added and deleted, before the result is a Cayley graph of an abelian group of order $n$ on the same vertex set? This defines two invariants, the completi...

Rigobert Fokam Souop, Laurent Bitjoka · 2 citations · ⚡2
Preprint Sep 2026

Induced Embeddings of Graphs into Abelian Cayley Graphs

For a finite graph $G$ on $n$ vertices, let $\eta(G)$ denote the least order of a finite abelian group $\Gamma$ for which $G$ is an induced subgraph of some Cayley graph of $\Gamma$. Babai and S\'os (1985) settled the worst-case order of magnitude: it is $\Theta(n^2)$. We treat $\eta$ instead as an invariant of the ind...

Rigobert Fokam Souop, Laurent Bitjoka · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.