Independent domination in hypercubes (Q2367974): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for dichotomized matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Inequalities for the Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sphere bounds on the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is the difference between the domination and independent domination numbers of a cubic graph? / rank
 
Normal rank

Revision as of 18:32, 17 May 2024

scientific article
Language Label Description Also known as
English
Independent domination in hypercubes
scientific article

    Statements

    Independent domination in hypercubes (English)
    0 references
    0 references
    0 references
    19 August 1993
    0 references
    0 references
    independent domination
    0 references
    hypercube graphs
    0 references
    dominating sets
    0 references