Ara
Toplam kayıt 2, listelenen: 1-2
Vertex magic total labeling of middle and total graph of cycle
(Ankara Üniversitesi Fen Fakültesi, 2019-08-01)
A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the ...
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 ...