Name
Abstract | ||
|---|---|---|
Relationships between the following graph invariants are studied: The node clique cover number, @q\"0(G); the clique cover number @q\"1(G); node independence number, @b\"0(G); and an edge independence number, @b'\"1(G), We extend a theorem of Choudum, Parthasarathy and Ravindra with further statements equivalent to @q\"0(G) = @q\"1(G). More general results regarding the inequality @q\"0(G) = |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90054-7 | Discrete Mathematics |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Independence number,Clique,Clique cover,Invariant (mathematics),Mathematics | Journal | 44 |
Issue | ISSN | Citations |
2 | Discrete Mathematics | 12 |
PageRank | References | Authors |
2.54 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert C. Brigham | 1 | 157 | 26.74 |
| Ronald D. Dutton | 2 | 190 | 27.80 |