Loading...
Please wait, while we are loading the content...
Similar Documents
Sigma clique covering of graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Davoodi, Akbar Javadi, Ramin Omoomi, Behnaz |
| Copyright Year | 2015 |
| Abstract | The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is de?ned 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1503.02380v1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |