A (SAML) of a directed graph is a bijection with the property that for every we have equals to an integer constant. If are distinct for every , then is a \textit{subtractive arc-antimagic labeling} (SAAL). A (SVML) of is such bijection with the property that for every we have $\lambda(x)+\sum_{y\in V, yx \in A} \lambda(yx)-\sum_{y\in V, xy\in A} \lambda(xy)\lambda(x)+\sum_{y\in V, yx \in A} \lambda(yx)-\sum_{y\in V, xy\in A} \lambda(xy)x\in V\lambda$ is a (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.

生成讲解博客的中文版本

生成AI智能校验的中文版本