3-total edge product cordial labeling of some new classes of graphs. Issue 3 (3rd April 2018)

• Record Type: Journal Article
• Authors: Yan, Li; Li, Yingfang; Zhang, Xiujun; Saqlain, Madiha; Zafar, Sohail; Farahani, Mohammad R.
• Is Part Of: Journal of information & optimization sciences. Volume 39:Issue 3(2018)
• Page Start: 705
• Page End: 724
• Publication Date: 2018-04-03
• Subjects: 05C15 -- 05C38 -- 05C40; 3-total edge product cordial labeling -- Corona graph -- Subdivision of a graph; Electronic data processing -- Periodicals; Information science -- Periodicals; Mathematical optimization -- Periodicals; 519.6
• DOI: 10.1080/02522667.2017.1417727
• Languages: English
• ISSNs: 0252-2667

Abstract

Abstract: In this paper we study 3-total edge product cordial (3-TEPC) labeling of some new classes of graphs. We study ladder graph, wheel graph, m isomorphic copies of n –cycle graph and dutch windmill graph in the context of 3-TEPC labeling. We also studied 3-TEPC labeling of some particular examples of graph operations like corona graphs and subdivision graphs.