Konu "Complete bipartite graph" için listeleme
Toplam kayıt 2, listelenen: 1-2
-
Harmonic Mean Cordial labeling of some graphs
(Işık University Press, 2024-01)All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) → {1, 2} is called Harmonic Mean Cordial if the induced function f*: E(G) → {1, ... -
M Modulo N graceful labeling of path union and join sum of complete bipartite graphs with its algorithms
(Işık University Press, 2022)A graceful labeling of a graph G(p, q) is an injective assignment of labels from the set {0, 1, ..., q} to the vertices of G such that when each edge of G has been assigned a label defined by the absolute difference of its ...