Antimagic labeling graphs with a regular dominating subgraph

DOI10.1016/J.IPL.2012.07.017zbMATH Open1248.05184OpenAlexW1984725468MaRDI QIDQ456149FDOQ456149

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

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

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)

Cites Work

• Title not available (Why is that?)
• Dense graphs are antimagic
• Title not available (Why is that?)
• Antimagic labeling and canonical decomposition of graphs

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
• Title not available (Why is that?)
• 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)