Bhat, Smitha and Bhat, Ravishankar S and Bhat, Surekha R
(2019)
*Bounds On Independence Number And Clique Independence Number Of A Graph.*
International Journal of Pure and Applied Mathematics, 120 (8).
pp. 11-19.
ISSN 1311-8080

PDF
6111.pdf - Published Version Restricted to Registered users only Download (265kB) | Request a copy |

## Abstract

A set S � V is independent if no two vertices in S are adjacent. The order of a maximum independent set is the independence number �0 = �0(G). A maximal complete subgraph of G is called a clique. A set L of cliques of G is said to be clique independent set (CI-set) if no two cliques have a vertex in common. The clique independence number �c = �c(G) is the maximum number of cliques in a CI-set of G. In this paper several bounds for independence number and clique independence number are derived and we characterized the graphs attaining some of these bounds.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Independence number; Clique independence number; Minimum clique number; Maximum clique number; Well clique covered graphs |

Subjects: | Engineering > MIT Manipal > Mathematics |

Depositing User: | MIT Library |

Date Deposited: | 11 Feb 2019 06:47 |

Last Modified: | 11 Feb 2019 06:47 |

URI: | http://eprints.manipal.edu/id/eprint/153249 |

### Actions (login required)

View Item |