Sigma clique covering of graphs
From MaRDI portal
Publication:6259752
arXiv1503.02380MaRDI QIDQ6259752FDOQ6259752
Behnaz Omoomi, A. Davoodi, Ramin Javadi
Publication date: 9 March 2015
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.
This page was built for publication: Sigma clique covering of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259752)
