Academia.eduAcademia.edu

Figure 3 – uploaded by Samir Vaidya

See full PDFdownloadDownload figure
Theorem 2.7. The complete graph Ky, admits total edge product cordial labeling for n > 2. Example 2.4. The gear graph Gs and its total edge product cordial labeling is shown in figure 4.

Figure 4 Theorem 2.7. The complete graph Ky, admits total edge product cordial labeling for n > 2. Example 2.4. The gear graph Gs and its total edge product cordial labeling is shown in figure 4.

Related Figures (8)

Theorem 2.4. The graph Oy” is a total edge product cordial graph.
Theorem 2.4. The graph Oy” is a total edge product cordial graph.
Theorem 2.6. The gear graph G,, is a total edge product cordial graph. Example 2.3. The wheel Ws and its total edge product cordial labeling is shown in figure 8.
Theorem 2.6. The gear graph G,, is a total edge product cordial graph. Example 2.3. The wheel Ws and its total edge product cordial labeling is shown in figure 8.
Hxample 2.5. The complete graph Ks and its total edge product cordial labeling is shown in figure 5. Here
Hxample 2.5. The complete graph Ks and its total edge product cordial labeling is shown in figure 5. Here
Remark 2.1. There is no possibility for any forbidden subgraph characterization for total edge product cordial labeling as Ky, admits total edge product cordial labeling.
Remark 2.1. There is no possibility for any forbidden subgraph characterization for total edge product cordial labeling as Ky, admits total edge product cordial labeling.
Theorem 2.9. The fan fr is a total edge product cordial graph. Case 1: When n is odd.
Theorem 2.9. The fan fr is a total edge product cordial graph. Case 1: When n is odd.
Example 2.7. The fan f4 and its total edge product cordial labeling is shown in figure 7. Theorem 2.10. The double fan Dfn is a total edge product cordial graph. Proof. Let v and u be vertices with degree n — 1 and vj, v2,...,Un be the other vertices of the double fan Df(n). We define f : E(Df,) > {0,1} as follows.
Example 2.7. The fan f4 and its total edge product cordial labeling is shown in figure 7. Theorem 2.10. The double fan Dfn is a total edge product cordial graph. Proof. Let v and u be vertices with degree n — 1 and vj, v2,...,Un be the other vertices of the double fan Df(n). We define f : E(Df,) > {0,1} as follows.
Related topics:
Mathematics
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved