Skip to content

Author

Gete Umbrey

1 paper 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.

Open access Sep 2026

Maximal Cliques as a Normal Form in the Algebra of Graphs: Compression by Modular Decomposition and an Enumeration Algorithm

The finite simple graphs with vertices in a set S form an algebra G(S) under union and join, generated by the one-vertex graphs. We show that this algebra has a canonical normal form whose data are exactly the maximal cliques of the graph. Precisely, every g∈G(S) admits a unique maximal-clique decomposition μ(g), chara...

B. Sarma, Gete Umbrey, M. Enduri · 0 citations

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