Edge-recognizable domination numbers. (Q1415542): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3818357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5544087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reconstructing graphs from their sets of subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidegreed graphs are edge reconstructible / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank

Revision as of 12:08, 6 June 2024

scientific article
Language Label Description Also known as
English
Edge-recognizable domination numbers.
scientific article

    Statements

    Edge-recognizable domination numbers. (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2003
    0 references
    Edge-reconstruction
    0 references
    Connected domination
    0 references
    Total domination
    0 references
    Paired domination
    0 references
    \(k\)-domination
    0 references
    Distance-\(k\) domination
    0 references

    Identifiers