Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs

From MaRDI portal




Abstract: A extit{subtractive arc-magic labeling} (SAML) of a directed graph G=(V,A) is a bijection lambda:VcupAo1,2,ldots,|V|+|A| with the property that for every xyinA we have lambda(xy)+lambda(y)−lambda(x) equals to an integer constant. If lambda(xy)+lambda(y)−lambda(x) are distinct for every xyinA, then lambda is a extit{subtractive arc-antimagic labeling} (SAAL). A extit{subtractive vertex-magic labeling} (SVML) of G is such bijection with the property that for every xinV we have lambda(x)+sumyinV,yxinAlambda(yx)−sumyinV,xyinAlambda(xy) equals to an integer constant. If lambda(x)+sumyinV,yxinAlambda(yx)−sumyinV,xyinAlambda(xy) are distinct for every xinV, then lambda is a extit{subtractive vertex-antimagic labeling} (SVAL). In this paper we prove some existence or non-existence of SAML, SVML, SAAL, and SVAL for several basic families of directed graphs, such as paths, cycles, stars, wheels, tadpoles, friendship graphs, and general butterfly graphs. The constructions are given when such labeling(s) exists.














This page was built for publication: Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs

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