Konu "Join of two graphs" için JAEM 2024, Vol 14, No 1 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, ... -
Total edge irregularity strength of join of path and complement of a complete graph
(Işık University Press, 2024-01)An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, ..., k} in such a way that any two different edges have distinct weights. The weight of an edge ...