Antimagic labeling graphs with a regular dominating subgraph

DOI10.1016/j.ipl.2012.07.017zbMath1248.05184OpenAlexW1984725468MaRDI QIDQ456149

Radek Slíva

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.017

zbMATH Keywords

combinatorial problemsantimagic labelingantimagic graphsdominating subgraph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Graphs admitting antimagic labeling for arbitrary sets of positive integers ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers

Cites Work

• Antimagic labeling and canonical decomposition of graphs
• Dense graphs are antimagic
• Unnamed Item
• Unnamed Item

This page was built for publication: Antimagic labeling graphs with a regular dominating subgraph