On secure domination in graphs (Q2348710): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5709011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4812925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination and secure total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461705 / rank
 
Normal rank

Revision as of 05:04, 10 July 2024

scientific article
Language Label Description Also known as
English
On secure domination in graphs
scientific article

    Statements

    On secure domination in graphs (English)
    0 references
    15 June 2015
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    secure domination
    0 references
    independence
    0 references
    domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers