Ara
Toplam kayıt 2, listelenen: 1-2
Roman and inverse roman domination in network of triangles
(Işık University Press, 2023-04)
In graph G (V, E), a function f : V ? {0, 1 2} is said to be a Roman Dominating Function (RDF). If ?u ? V, f(u) = 0 is adjacent to at least one vertex v ? V such that f(v) = 2. The weight of f is given by w(f) = P v?V f(v). ...
Parallel critical graphs
(Işık University Press, 2023-04)
Let G1 and G2 be two undirected graphs. Let u1, v1 ? V ( G1 ) and u2, v2 ? V ( G2 ). A parallel composition forms a new graph H that combines G1 and G2 by contracting the vertices u1 with u2 and v1 with v2. A new kind of ...