2023/08/22 by Vinothkumar Latchoumanane, Latchoumanane, Vinothkumar, Murugan Varadhan +3
Computer Science · #Blockchain Technology in Education and Learning #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2308.11663
openalex publication_date 2023/08/22 · openalex created_date 2023/08/26 · openalex updated_date 2026/07/28
A graph G is antimagic if there exists a bijection f from E(G) to \1,2, …,|E(G)|\ 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 K2 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.