Difference Cordial Labelling and Product Cordial Labelling in Some Extended Graphs

This paper presents the existence of Difference Cordial Labelling and product cordial labelling, with an extensive study on labelling of Konigsberg bridge problem and Möbius–Kantor Graph. The authors investigate the difference cordial labelling behaviour of certain graphs, including path, cycle, star, and comb. The paper is based on the work of previous authors and intends to study these two properties on certain graphs.