The Cartesian product of wheel graph and path graph is antimagic

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Joseph Ancy Kandathil; Kureethara Joseph Varghese

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2023 | Volume:8 | Issue:4 Page(s): 639-647

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

The Cartesian product of wheel graph and path graph is antimagic

Author(s)

Joseph Ancy Kandathil | Kureethara Joseph Varghese | Issue Writer Certificate

Keywords

graph labeling

Antimagic labeling

Magic labeling

Abstract

Suppose each edge of a simple connected undirected graph is given a unique number from the numbers $1, 2, \dots, $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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans