z-logo
open-access-imgOpen Access
Some New Results on Global Dominating Sets
Author(s) -
S. K. Vaidya,
R. M. Pandit
Publication year - 2012
Publication title -
isrn discrete mathematics
Language(s) - English
Resource type - Journals
ISSN - 2090-7788
DOI - 10.5402/2012/852129
Subject(s) - algorithm , computer science , dominating set , complement (music) , graph , artificial intelligence , mathematics , chemistry , theoretical computer science , vertex (graph theory) , biochemistry , complementation , gene , phenotype
A dominating set is called a global dominating set if it is a dominating set of a graph and its complement . A natural question arises: are there any graphs for which it is possible to relate the domination number and the global domination number? We have found an affirmative answer to this question and obtained some graphs having such characteristic.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom