Inverse Domination in Graphs - Inverse Domination, General Properties, Grid Graphs

The concept of dominating sets introduced by Ore and Berge, is currently receiving much attention in the literature of graph theory. Several types of domination parameters have been studied by imposing several conditions on dominating sets. Ore observed that the complement of every minimal dominating set of a graph with minimum degree at least one is also a dominating set. This implies that every graph with minimum degree at least one has two disjoint dominating sets. Recently several authors initiated the study of the cardinalities of pairs of disjoint dominating sets in graphs. The inverse domination number is the minimum cardinality of a dominating set whose complement contains a minimum dominating set. Motivated by the inverse domination number, there are studies which deals about two disjoint domination number of a graph.

About the author

T. TAMIZH CHELVAM is the Professor and Chairman of Department of Mathematics at Manonmaniam Sundaranar University, India. He has authored 85 referred papers on Algebra & Graph Theory. T. ASIR is D.S. Kothari Post Doctoral Fellow and a Doctorate in Algebraic Graph Theory. G.S. Grace Prema is Associate Professor at St. John's College, Palayamkottai

Product details

• Authors: Asir, T Asir, T. Asir, G S Grace Prema, G. S. Grace Prema, Tamizh Chelvam, T Tamizh Chelvam, T. Tamizh Chelvam
• Publisher: LAP Lambert Academic Publishing
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.2013
• EAN: 9783659362903
• ISBN: 978-3-659-36290-3
• No. of pages: 120
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous