Super cyclic antimagic covering for some families of graphs
Muhammad Numan, Saad Ihsan Butt, Amir Taimur
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.
Topics & Concepts
Coding (social sciences)Computer scienceGraphGraph theoryCombinatoricsMathematicsTheoretical computer scienceStatisticsGraph Labeling and Dimension Problems