On Distance Antimagic Graphs

MaRDI QIDQ6247671zbMATH OpenFDO

Authors Rinovia Simanjuntak, Kristiana Wijaya

Publication date 28 December 2013

Mathematics Subject Classification ID

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

Abstract: For an arbitrary set of distances $Dsubseteq0,1,ldots,diam(G)$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:Vightarrow1,2,ldots,v$ is defined as $w_D(x)=su{m}_{yin{N}_D(x)}f(y)$, where $N_D(x)=yinV|d(x,y)inD$. A graph $G$ is said to be $D$-distance magic if all vertices has the same $D$-vertex-weight, it is said to be $D$-distance antimagic if all vertices have distinct $D$-vertex-weights, and it is called $(a,d)-D$-distance antimagic if the $D$-vertex-weights constitute an arithmetic progression with difference $d$ and starting value $a$. In this paper we study some necessary conditions for the existence of $D$-distance antimagic graphs. We conjecture that such conditions are also sufficient. Additionally, we study $1$-distance antimagic labelings for some cycle-related connected graphs: cycles, suns, prisms, complete graphs, wheels, fans, and friendship graphs.

This page was built for publication: On Distance Antimagic Graphs

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