
Inverse Domination in Graphs
Inverse Domination, General Properties, Grid Graphs
LAP Lambert Academic Publishing
Published on 9. May 2013
Book
Paperback/Softback
120 pages
978-3-659-36290-3 (ISBN)
Description
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.
More details
Language
English
Product notice
Paperback (trade)
Unsewn / adhesive bound
Dimensions
Height: 220 mm
Width: 150 mm
Thickness: 8 mm
Weight
197 gr
ISBN-13
978-3-659-36290-3 (9783659362903)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
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