Inverse Independence Number of a Graph

Bhat , Pradeep G and Bhat, Surekha R (2012) Inverse Independence Number of a Graph. International Journal of Computer Applications, 42 (5). pp. 9-13. ISSN 0975 – 8887

[img] PDF
Invere pub paper.pdf - Published Version
Restricted to Registered users only

Download (597kB) | Request a copy

Abstract

The concept of inverse domination was introduced by Kulli V.R. and Sigarakanti S.C. [9] . Let D be a  - set of G. A dominating set D1  V- D is called an inverse dominating set of G with respect to D. The inverse domination number   (G) is the order of a smallest inverse dominating set. Motivated by this definition we define another parameter as follows. Let D be a maximum independent set in G. An independent set S  V- D is called an inverse independent set with respect to D. The inverse independence Number β0-1(G) = max { S : S is an inverse independent set of G}.We find few bounds on inverse domination number and also initiate the study of the inverse independence number giving few bounds on inverse independence number of a graph.

Item Type: Article
Uncontrolled Keywords: International Journal of Computer Applications
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 24 Oct 2013 05:25
Last Modified: 24 Oct 2013 05:25
URI: http://eprints.manipal.edu/id/eprint/137557

Actions (login required)

View Item View Item