Abstract
Graph labeling plays an important role in different branches of sciences. It gives useable information in the study of radar, missile and rocket theory. In scheme theory, coding theory and computer networking graph labeling is widely employed. In the present paper, we find necessary conditions for the octagonal planner map and multiple wheel graph to be super cyclic antimagic cover and then discuss their super cyclic antimagic covering.
Highlights
Introduction and definitionsI n the present paper all graphs are finite simple and we follow the notion and terminology from the book [1]
We find necessary conditions for the octagonal planner map and multiple wheel graph to be super cyclic antimagic cover and discuss their super cyclic antimagic covering
The upper bound for the parameter d under super (a, d)-C8-antimagic covering of Olk is computed as following: Theorem 1
Summary
Academic Editor: Wei Gao Received: 2 July 2020; Accepted: 18 January 2021; Published: 21 January 2021. Abstract: Graph labeling plays an important role in different branches of sciences. It gives useable information in the study of radar, missile and rocket theory. In scheme theory, coding theory and computer networking graph labeling is widely employed. We find necessary conditions for the octagonal planner map and multiple wheel graph to be super cyclic antimagic cover and discuss their super cyclic antimagic covering
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
