Edge criticality in secure graph domination (Q1751134): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5461685 / 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: Vertex Covers and Secure Domination in Graphs / 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: Q4812925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5173719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination critical graphs / rank
 
Normal rank

Revision as of 16:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Edge criticality in secure graph domination
scientific article

    Statements

    Edge criticality in secure graph domination (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    graph protection
    0 references
    edge criticality
    0 references
    edge removal
    0 references
    secure domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers