Ara
Toplam kayıt 2, listelenen: 1-2
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
(Işık University Press, 2021)
A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ...
I-Cordial labeling of spider graphs
(Işık University Press, 2021)
Let G= (V, E) be a graph with p vertices and q edges. A graph G=(V,E)with p vertices and q edges is said to be an I-cordial labeling of a graph if there exists an injective map f from V to left perpendicular-p/2..p/2right ...