On clique covers and independence numbers of graphs |
| |
| Authors: | Robert C Brigham Ronald D Dutton |
| |
| Institution: | Departments of Mathematics and Statistics and Computer Science, University of Central Florida, P.O. Box 25000, Orlando, FL 32816, USA;Department of Computer Science, University of Central Florida, P.O. Box 25000, Orlando, FL 32816, USA |
| |
| Abstract: | Relationships between the following graph invariants are studied: The node clique cover number, θ0(>G); the clique cover number θ1(G); node independence number, β0(G); and an edge independence number, β′1(G), We extend a theorem of Choudum, Parthasarathy and Ravindra with further statements equivalent to θ0(G) = θ1(G). More general results regarding the inequality θ0(G) ? 01(G) are presented. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
