The Integer-antimagic Spectra of Graphs with a Chord

Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(uv)$, is injective. The integer-antimagic spe...

Full description

Bibliographic Details
Main Authors: Richard Low, Dan Roberts, Jinze Zheng
Format: Article
Language:English
Published: Georgia Southern University 2021-02-01
Series:Theory and Applications of Graphs
Subjects:
Online Access:https://digitalcommons.georgiasouthern.edu/tag/vol8/iss1/1
Description
Summary:Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(uv)$, is injective. The integer-antimagic spectrum of a graph $G$ is the set IAM$(G) = \{k\;|\; G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic}$ $\textnormal{and } k \geq 2\}$. In this paper, we determine the integer-antimagic spectra for cycles with a chord, paths with a chord, and wheels with a chord.
ISSN:2470-9859