Ara
Toplam kayıt 1042, listelenen: 1041-1042
Root cube mean cordial labeling of Cn ? Cm, for n, m ? N
(Işık University Press, 2024-04)
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) ? {0, 1, 2} is called root cube mean cordial labeling if the induced function f? ...
Independent domination number of graphs through vertex switching
(Işık University Press, 2024-04)
Let G = (V, E) be a graph with vertex set V and edge set E. An independent dominating set S of G is a subset of V with the property that every vertex in V ? S is adjacent to some vertex in S and no two vertices within S ...