Further results on edge product cordial labeling

Document Type

Article

Publication Date

Winter 12-2020

Abstract

In this paper, we present some properties of Edge Product Cordial graphs and make a survey on all graphs of order at most 6 to find out whether they are Edge Product Cordial or not. Finally, we study some families of graphs to be Edge Product Cordial or not: 𝐾𝐾2,𝑛𝑛 (π‘šπ‘š), 𝑆𝑆𝑆𝑆(𝑛𝑛), 𝑇𝑇𝑛𝑛⨀𝐾𝐾1, π‘ƒπ‘ƒπ‘›π‘›β¨€πΎπΎπ‘šπ‘š Μ…Μ…Μ…Μ…, πΆπΆπ‘›π‘›β¨€πΎπΎπ‘šπ‘š Μ…Μ…Μ…Μ…, π‘ƒπ‘ƒπ‘›π‘›βˆ§πΆπΆπ‘šπ‘š and the graph obtained from πΆπΆπ‘šπ‘š by attaching a pendant path 𝑃𝑃𝑛𝑛 to every vertex of πΆπΆπ‘šπ‘š.

Link to Full Text

Share

COinS