(<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-Distance Antimagic Labeling of Some Types of Graphs |
| |
Authors: | M F Semeniuta |
| |
Affiliation: | 1.Kirovograd Flight Academy,National Aviation University,Kropyvnytskyi,Ukraine |
| |
Abstract: | We analyze the necessary existence conditions for (a, d)-distance antimagic labeling of a graph G = (V, E) of order n. We obtain theorems that expand the family of not (a, d) -distance antimagic graphs. In particular, we prove that the crown P n ○ P 1 does not admit an (a, 1)-distance antimagic labeling for n ≥ 2 if a ≥ 2. We determine the values of a at which path P n can be an (a, 1)-distance antimagic graph. Among regular graphs, we investigate the case of a circulant graph. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|