The cost of edge removal in graph domination (Q4956237): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5173719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge criticality in graph domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank

Latest revision as of 12:18, 26 July 2024

scientific article; zbMATH DE number 7389458
Language Label Description Also known as
English
The cost of edge removal in graph domination
scientific article; zbMATH DE number 7389458

    Statements

    The cost of edge removal in graph domination (English)
    0 references
    1 September 2021
    0 references
    graph domination
    0 references
    edge removal
    0 references
    criticality
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers