Shifted-antimagic labelings for graphs

DOI10.1007/S00373-021-02305-WzbMATH Open1478.05124arXiv1806.06019OpenAlexW3151693010MaRDI QIDQ2045398FDOQ2045398

Authors: Fei-Huang Chang, Wei-Tian Li, Zhishi Pan, Hongbin Chen 

Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees. This paper studies a weak version called $k$-shifted-antimagic labelings which allow the consecutive numbers starting from $k+1$, instead of starting from 1, where $k$ can be any integer. This paper establishes connections among various concepts proposed in the literature of antimagic labelings and extends previous results in three aspects: $$ Some classes of graphs, including trees and graphs whose vertices are of odd degrees, which have not been verified to be antimagic are shown to be $k$-shifted-antimagic for sufficiently large $k$. $$ Some graphs are proved $k$-shifted-antimagic for all $k$, while some are proved not for some particular $k$. $$ Disconnected graphs are also considered.

Full work available at URL: https://arxiv.org/abs/1806.06019

Recommendations

• Antimagic labeling of forests with sets of consecutive integers
• Labeling trees of small diameters with consecutive integers
• Antimagic labeling of new classes of trees
• On antimagic labeling of odd regular graphs
• Sparse graphs with vertex antimagic edge labelings

zbMATH Keywords

treesantimagic labelingdisconnected graphs

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On zero-sum partitions and anti-magic trees
• Antimagic labelling of vertex weighted graphs
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Title not available (Why is that?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Computing and Combinatorics
• On anti-magic labeling for graph products
• On the antimagic labeling of star forests
• Antimagic labeling of cubic graphs
• On antimagic labeling for power of cycles.
• Antimagic labeling of regular graphs
• Anti-magic labeling of trees
• Regular graphs of odd degree are antimagic
• Antimagic labelings of caterpillars
• Title not available (Why is that?)
• Title not available (Why is that?)
• The strongly antimagic labelings of double spiders

Cited In (7)

• Every graph is homeomorphic to an antimagic bipartite graph
• Antimagic labeling of forests with sets of consecutive integers
• On \(k\)-shifted antimagic spider forests
• Antimagic labeling for subdivisions of graphs
• Labeling trees of small diameters with consecutive integers
• Graph antimagic labeling: a survey
• Antimagic labeling for unions of graphs with many three-paths

This page was built for publication: Shifted-antimagic labelings for graphs

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