Secure domination critical graphs (Q1045117): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3421948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundance, secure domination and maximum degree in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / 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: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defending the Roman Empire from multiple attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defending the Roman Empire---a new strategy / 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: Q5461705 / rank
 
Normal rank

Revision as of 06:55, 2 July 2024

scientific article
Language Label Description Also known as
English
Secure domination critical graphs
scientific article

    Statements

    Secure domination critical graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    secure domination
    0 references
    protection of a graph
    0 references
    edge-removal-critical graph
    0 references
    ER-critical graph
    0 references

    Identifiers