Prime labeling is a bijective labeling of the vertices of a graph such that every pair of adjacent vertices receives relatively prime integers. A graph that admits such a labeling is called a prime graph. This paper studies the prime labeling of a modified type I star flower graph, denoted by $SFl_{p,q}(1)$, and the graph obtained from the comb operation between $SFl_{p,q}(1)$ and the simple graph $S_1$. The results show that the star flower graph $SFl_{p,q}(1)$ is a prime graph for every $p \ge 3$. Furthermore, the comb product $SFl_{p,q}(1) \triangleright_o S_1$ is also a prime graph.
Copyrights © 2026