We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Prime Cordial Labeling of Generalized Petersen Graph under Some Graph Operations.
- Authors
Zhao, Weidong; Naeem, Muhammad; Ahmad, Irfan
- Abstract
A graph is a connection of objects. These objects are often known as vertices or nodes and the connection or relation in these nodes are called arcs or edges. There are certain rules to allocate values to these vertices and edges. This allocation of values to vertices or edges is called graph labeling. Labeling is prime cordial if vertices have allocated values from 1 to the order of graph and edges have allocated values 0 or 1 on a certain pattern. That is, an edge has an allocated value of 0 if the incident vertices have a greatest common divisor (gcd) greater than 1. An edge has an allocated value of 1 if the incident vertices have a greatest common divisor equal to 1. The number of edges labeled with 0 or 1 are equal in numbers or, at most, have a difference of 1. In this paper, our aim is to investigate the prime cordial labeling of rotationally symmetric graphs obtained from a generalized Petersen graph P (n , k) under duplication operation, and we have proved that the resulting symmetric graphs are prime cordial. Moreover, we have also proved that when we glow a Petersen graph with some path graphs, then again, the resulting graph is a prime cordial graph.
- Subjects
PETERSEN graphs; GRAPH labelings; CHARTS, diagrams, etc.
- Publication
Symmetry (20738994), 2022, Vol 14, Issue 4, pN.PAG
- ISSN
2073-8994
- Publication type
Article
- DOI
10.3390/sym14040732