Table of Contents
Fetching ...

The direct product of a star and a path is antimagic

Vinothkumar Latchoumanane, Murugan Varadhan, Andrea Semaničová-Feňovčíková

Abstract

A graph $G$ is antimagic if there exists a bijection $f$ from $E(G)$ to $\left\{1,2, \dots,|E(G)|\right\}$ such that the vertex sums for all vertices of $G$ are distinct, where the vertex sum is defined as the sum of the labels of all incident edges. Hartsfield and Ringel conjectured that every connected graph other than $K_2$ admits an antimagic labeling. It is still a challenging problem to address antimagicness in the case of disconnected graphs. In this paper, we study antimagicness for the disconnected graph that is constructed as the direct product of a star and a path.

The direct product of a star and a path is antimagic

Abstract

A graph is antimagic if there exists a bijection from to such that the vertex sums for all vertices of are distinct, where the vertex sum is defined as the sum of the labels of all incident edges. Hartsfield and Ringel conjectured that every connected graph other than admits an antimagic labeling. It is still a challenging problem to address antimagicness in the case of disconnected graphs. In this paper, we study antimagicness for the disconnected graph that is constructed as the direct product of a star and a path.
Paper Structure (5 sections, 10 theorems, 35 equations, 2 figures)

This paper contains 5 sections, 10 theorems, 35 equations, 2 figures.

Key Result

Theorem 1

Weichsel Let $G$ and $H$ be connected graphs. The direct product $G \times H$ connected if and only if either $G$ or $H$ contains an odd cycle.

Figures (2)

  • Figure 1: An antimagic labeling of of $K_{1,3}\times P_{8}$.
  • Figure 2: An antimagic labeling of of $K_{1,3}\times P_{7}$.

Theorems & Definitions (16)

  • Theorem 1
  • Theorem 3
  • Lemma 4
  • proof
  • Lemma 5
  • proof
  • Theorem 6
  • proof
  • Theorem 7
  • Lemma 8
  • ...and 6 more