Ara
Toplam kayıt 1, listelenen: 1-1
Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
(Ankara Üniversitesi Fen Fakültesi, 2019-08-01)
Cordial labeling is one of the useful labeling in the realm of graph labeling. For the graph G=(V,E) vertex set V is label by {0,1}, where labeling of edge set E calculated by absolute difference between the end vertices ...