Inverse Domination in Graphs


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 3,718

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product 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.

Product Specifications
SKU :COC67783
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
0 Review(s)