Abstract
Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic. Since then, many classes of graphs have been proved to be antimagic. But few is known about the antimagicness of lexicographic product graphs. In this paper, via the construction of a directed Eulerian circuit, the Siamese method, and some modification on graph labeling, the antimagicness of lexicographic product graph G[Pn] is obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Acta Mathematicae Applicatae Sinica, English Series
Paper Title
Journal
Date
