Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Keywords = ladder
Number of Articles: 3
Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs
Volume 54, Issue 2 , December 2022, , Pages 37-47
Abstract
In this paper, we consider only finite, undirected, and simple graphs. The concept of cordial labeling was introduced by Cahit[4]. Different types of cordial-related labeling were studied in [1, 2, 3, 5, 16]. In a similar line, the notion of pair difference cordial labeling of a graph was introduced ... Read MorePair mean cordial labeling of graphs
Volume 54, Issue 1 , June 2022, , Pages 1-10
Abstract
In this paper, we introduce a new graph labeling called pair mean cordial labeling of graphs. Also, we investigate the pair mean cordiality of some graphs like path, cycle, complete graph, star, wheel, ladder, and comb. Read MoreFurther results on total mean cordial labeling of graphs
Volume 46, Issue 1 , December 2015, , Pages 73-83