Graphs which,with their complements,have certain clique covering numbers |
| |
| Authors: | Robert C Brigham Ronald D Dutton |
| |
| Institution: | Department of Mathematics and Statistics 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: | Two common invariants of a graph G are its node clique cover number, θ0(G), and its edge clique cover number, θ1(G). We present in this work a characterization of those graphs for which they and their complements, , have θ0(G)=θ1(G) and θ0()=θ1(). Graphs satis ying these conditions are shown to constitute a subset of those graphs which we term C-graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
