Sigma clique covering of graphs
Combinatorics
2016-10-05 v1
Abstract
The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a collection of cliques of G, covering (resp. partitioning) all edges of G such that the sum of sizes of the cliques is at most k. In this paper, among some results we provide some tight bounds for scc and scp.
Cite
@article{arxiv.1503.02380,
title = {Sigma clique covering of graphs},
author = {Akbar Davoodi and Ramin Javadi and Behnaz Omoomi},
journal= {arXiv preprint arXiv:1503.02380},
year = {2016}
}