Super cyclic antimagic covering for some families of graphs

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.

Distance-Based Polynomials and Topological Indices for Hierarchical Hypercube Networks

“…A graph G is simple if it has no loop or multiple edges and is connected if there is a path between every two vertices of it. e distance between any two vertices u and v is denoted by d(u, v) and is the length of the shortest path between u and v. e diameter of a graph is the maximum distance between any two vertices of G. e notions that are used in this paper but not defined can be found in [35,36]. Definition 1 (Hosoya polynomial [16]).…”

Hypergraphical Metric Spaces and Fixed Point Theorems

“…In this way, we refer some recent developments in [1][2][3]. About basic notions of graph theory, we refer to the readers [4][5][6] and references therein.…”

Computation of the Double Metric Dimension in Convex Polytopes

“…In 2015, Tomescu and Imran used R−sets for the computation of the metric dimension of necklace graphs [20]. Ahmad et al computed the metric dimension for the families of kayak paddle graphs and chorded cycles (for details, see [21][22][23]).…”