Title

On Clique Covers And Independence Numbers Of Graphs

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Discret. Math.

Keywords

Mathematics

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.

Journal Title

Discrete Mathematics

Volume

44

Issue/Number

2

Publication Date

1-1-1983

Document Type

Article

Language

English

First Page

139

Last Page

144

WOS Identifier

WOS:A1983QF66800002

ISSN

0012-365X

Share

COinS