Clique Cover Width and Clique Sum
Combinatorics
2015-02-26 v2
Abstract
For a clique cover in the undirected graph , the clique cover graph of is the graph obtained by contracting the vertices of each clique in into a single vertex. The clique cover width of G, denoted by , is the minimum value of the bandwidth of all clique cover graphs of . When is the clique sum of and , we prove that .
Cite
@article{arxiv.1502.06165,
title = {Clique Cover Width and Clique Sum},
author = {Farhad Shahrokhi},
journal= {arXiv preprint arXiv:1502.06165},
year = {2015}
}