Antimagic labeling graphs with a regular dominating subgraph (Q456149): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3999001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs are antimagic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labeling and canonical decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank

Latest revision as of 20:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Antimagic labeling graphs with a regular dominating subgraph
scientific article

    Statements

    Antimagic labeling graphs with a regular dominating subgraph (English)
    0 references
    0 references
    23 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    antimagic labeling
    0 references
    antimagic graphs
    0 references
    dominating subgraph
    0 references
    0 references