PMC-labeling of prism allied graph, pendulum graph and cog wheel graph
Citation
Ponraj, R. & Prabhu, S. (2025). PMC-labeling of prism allied graph, pendulum graph and cog wheel graph. TWMS Journal of Applied and Engineering Mathematics, 15(11), 2664-2673.Abstract
In this paper, we investigate the PMC-labeling behavior of some graphs like pendulum graph, hexagonal circular ladder, cog wheel graph, triangular wheel graph, double crown-wheel graph, crown-triangular wheel graph, Hn,n, P3 × Pn, prism allied graph and antiprism allied graph.
Volume
15Issue
11URI
https://jaem.isikun.edu.tr/web/index.php/current/137-vol15no11/1520https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7083
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
- 
On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs 
C. K., Bhanupriya; M. S., Sunitha (Işık University Press, 2025-01)The injective chromatic number of a graph G, denoted by χi(G) is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The splitting graph ... - 
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs 
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... - 
Morphisms on middle graph of semiring valued graphs 
Tamilselvi, Annamalai (Işık University Press, 2024-10)The middle graph M(G) of a graph G is an intersection graph on the vertex set V (G) of any graph G. Let E(G) be an edge set of G and F = V’ (G) ∪ E(G), where V’ (G) indicates the family of all one vertex subsets of the set ... 




