The Cartesian product of wheel graph and path graph is antimagic

Title

The Cartesian product of wheel graph and path graph is antimagic

Creator

Joseph A.K.; Kureethara J.V.

Description

Suppose each edge of a simple connected undirected graph is given a unique number from the numbers 1, 2, . . ., q, where q is the number of edges of that graph. Then each vertex is labelled with sum of the labels of the edges incident to it. If no two vertices have the same label, then the graph is called an antimagic graph. We prove that the Cartesian product of wheel graph and path graph is antimagic. 2023 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-8, No. 4, pp. 639-647.

Date

2023-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

antimagic labeling; Graph labeling; magic labeling

Coverage

Joseph A.K., Department of Mathematics, Christ University, Bangalore, India; Kureethara J.V., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/CCO.2022.27645.1307

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85161975789&doi=10.22049%2fCCO.2022.27645.1307&partnerID=40&md5=35bf3767bf553f7d3bf6ccfc8da19188