Edge Weighting Functions on Dominating Sets (Q4916094): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the upper total domination number of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of upper total domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex criticality for upper domination and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper domination and upper irredundance perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper total domination in claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-induced subgraph characterization of upper domination perfect graphs / rank
 
Normal rank

Latest revision as of 08:45, 6 July 2024

scientific article; zbMATH DE number 6155906
Language Label Description Also known as
English
Edge Weighting Functions on Dominating Sets
scientific article; zbMATH DE number 6155906

    Statements

    Edge Weighting Functions on Dominating Sets (English)
    0 references
    0 references
    0 references
    19 April 2013
    0 references
    upper domination number
    0 references
    upper total domination number
    0 references
    regular graphs
    0 references
    dominating sets
    0 references

    Identifiers