Clique-partitioned graphs

From MaRDI portal
Publication:2127629



Abstract: A graph G of order nv where ngeq2 and vgeq2 is said to be weakly (n,v)-clique-partitioned if its vertex set can be decomposed in a unique way into n vertex-disjoint v-cliques. It is strongly (n,v)-clique-partitioned if in addition, the only v-cliques of G are the n cliques in the decomposition. We determine the structure of such graphs which have the largest possible number of edges.






Describes a project that uses

Uses Software






This page was built for publication: Clique-partitioned graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127629)