Abstract
Super (a, d)-H-antimagic total labeling is closely related to graph labeling, graph decomposition, graph covering and magic square and it arouses more and more peopleβs concerns. In this paper we study the super (a, d)-H-antimagic total labelings of path chain graph PCG(H,U, n), when d = 0, 1, 2, 3, 4.
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 call
