Inverse vertex covering number of a graph

Let G = (V, E) be a graph. Let D be a minimum vertex covering of G. If V - D contains a vertex cover D' of G, then D' is called an inverse vertex cover with respect to D. The inverse vertex covering number of G is the minimum cardinality of an inverse vertex cover of G. In this paper, we i...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete mathematical sciences & cryptography Vol. 15; no. 6; pp. 389 - 393
Main Authors Kulli, V. R., Iyer, R. R.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.12.2012
Subjects
Covering
Cryptography
Domination number
Graphs
Inverse
Inverse vertex covering number
Mathematical analysis
Vertex covering number
Online AccessGet full text

Cover

More Information
Summary:Let G = (V, E) be a graph. Let D be a minimum vertex covering of G. If V - D contains a vertex cover D' of G, then D' is called an inverse vertex cover with respect to D. The inverse vertex covering number of G is the minimum cardinality of an inverse vertex cover of G. In this paper, we initiate a study of this new parameter and establish some results on this parameter.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0972-0529
2169-0065
DOI:10.1080/09720529.2012.10698391