\([1,2]\)-domination in graphs (Q401141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3139841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4874588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \([1,2]\)-sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiperfect domination in triangular lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hamilton cycles in bipartite reflective Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank

Latest revision as of 22:12, 8 July 2024

scientific article
Language Label Description Also known as
English
\([1,2]\)-domination in graphs
scientific article

    Statements

    \([1,2]\)-domination in graphs (English)
    0 references
    0 references
    0 references
    26 August 2014
    0 references
    \([1,2]\)-sets
    0 references
    domination
    0 references
    lexicographic product
    0 references
    Nordhaus-Gaddum
    0 references
    restrained domination
    0 references

    Identifiers