Clique Cover Width and Clique Sum
Abstract
For a clique cover C in the undirected graph G, the clique cover graph of C is the graph obtained by contracting the vertices of each clique in C into a single vertex. The clique cover width of G, denoted by CCW(G), is the minimum value of the bandwidth of all clique cover graphs of G. When G is the clique sum of G1 and G2, we prove that CCW(G) 3/2(CCW(G1) + CCW(G2)).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.