•  
  •  
 

Keywords

Completely positive matrices, cp-rank, clique covering number, maximum size triangle free subgraph, outerplanar graph.

Abstract

The cp-rank of a graph G, cpr(G), is the maximum cp-rank of a completely positive matrix with graph G. One obvious lower bound on cpr(G) is the (edge-) clique covering number, cc(G), i.e., the minimal number of cliques needed to cover all of G’s edges. It is shown here that for a connected graph G, cpr(G) = cc(G) if and only if G is triangle free and not a tree. Another lower bound for cpr(G) is tf(G), the maximum size of a triangle free subgraph of G. We consider the question of when does the equality cpr(G) = tf(G) hold.

abs_vol28_pp99-116.pdf (21 kB)
Abstract

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.