On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels

Some results on cordiality labeling of generalized Jahangir graph

“…For more results on product cordial and total product cordial, please refer [4,5,6,9,10,11]. For n, m ≥ 2, the generalized Jahangir graph J n,m is a graph on nm + 1 vertices, that is, the graph consists of a cycle C mn with one additional vertex which adjacent to a m vertices of C mn at distance n to each other on C mn , see [1,7].…”

On friendly index sets and product-cordial index sets of gear graphs

“…is called the product-cordial index set of G (interested readers can also refer to [6,7]). As an example, a graph of type C 4 has only 2 ways to get |v f (1) -v f (0)| 1 as shown in Figure 1 below.…”