Antimagic labeling graphs with a regular dominating subgraph

DOI10.1016/J.IPL.2012.07.017MaRDI QIDQ456149zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 6374002
• On antimagic labeling of regular graphs with particular factors
• Regular graphs of odd degree are antimagic
• Antimagic labeling and canonical decomposition of graphs
• On antimagic labeling of odd regular graphs

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Antimagic labeling and canonical decomposition of graphs
• Dense graphs are antimagic

Cited in

(5)

• On antimagic labeling of regular graphs with particular factors
• Antimagic labeling and canonical decomposition of graphs
• Graphs admitting antimagic labeling for arbitrary sets of positive integers
• scientific article; zbMATH DE number 6374002 (Why is no real title available?)
• Graphs admitting antimagic labeling for arbitrary sets of positive numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456149)