Bounds on the connected \(k\)-domination number in graphs (Q608255): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050150370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating a Family of Graphs with Small Connected Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method in the theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3561427 / rank
 
Normal rank

Latest revision as of 13:05, 3 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the connected \(k\)-domination number in graphs
scientific article

    Statements

    Bounds on the connected \(k\)-domination number in graphs (English)
    0 references
    0 references
    25 November 2010
    0 references
    0 references
    \(k\)-domination
    0 references
    connected \(k\)-domination
    0 references
    total \(k\)-domination
    0 references
    connected total \(k\)-domination
    0 references
    0 references