Learn More
Let B(G) be classes of matrices associated with graph G. Here n is the number of ver-tices in graph G, and A(G) is the adjacency matrix of this graph. Denote r(G) = min X∈C(G) rank(X), r + (G) = min X∈B(G) rank(X). We have shown previously that for every graph G, α(G) ≤ r + (G) ≤ χ(G) holds and α(G) = r + (G) implies α(G) = χ(G). In this article we show(More)
  • 1