Paper Info
Title
Graphs which, with their complements, have certain clique covering numbers
Abstract
Two common invariants of a graph G are its node clique cover number, @q\"0(G), and its edge clique cover number, @q\"1(G). We present in this work a characterization of those graphs for which they and their complements, G@?, have @q\"0(G)=@q\"1(G) and @q\"0(G@?)=@q\"1(G@?). Graphs satis ying these conditions are shown to constitute a subset of those graphs which we term C-graphs.
Year
DOI
Venue
1981
10.1016/0012-365X(81)90016-9
Discrete Mathematics
Field
DocType
Volume
Discrete mathematics,Graph,Combinatorics,Clique,Chordal graph,Clique cover,Invariant (mathematics),Mathematics
Journal
34
Issue
ISSN
Citations 
1
Discrete Mathematics
9
PageRank 
References 
Authors
1.95
0
2
Name
Order
Citations
PageRank
Robert C. Brigham115726.74
Ronald D. Dutton219027.80