Some new results on global dominating sets (Q1935987): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5402/2012/852129 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070880802 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58692831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On roman, global and restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global domination and neighborhood numbers in Boolean function graph of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total global domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cordiality of the path-union of \(n\) copies of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank

Latest revision as of 05:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Some new results on global dominating sets
scientific article

    Statements

    Some new results on global dominating sets (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2013
    0 references
    Summary: A dominating set is called a global dominating set if it is a dominating set of a graph \(G\) and its complement \(\bar G\). 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.
    0 references
    0 references
    global dominating set
    0 references
    global domination number
    0 references
    0 references
    0 references