Total roman domination number of graphs
Künye
Thakkar, D. & Badiyani, S. (2022). Total roman domination number of graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(2), 445-455.Özet
In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any minimal total roman dominating function f. The operation of vertex removal has been considered. A necessary and sufficient condition under which the total roman domination number increases (under this operation) has been proved. Similarly a necessary and sufficient condition has been proved under which the total roman domination number decreases. Some examples has been given with miscellaneous results. We characterize those graphs for which the total roman domination number is equal to the number of vertices of the graph.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
12Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3825http://jaem.isikun.edu.tr/web/index.php/archive/115-vol12no2/830
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Signed total double Roman dominatıon numbers in digraphs
Amjadi, Jafar; Pour Hosseini, Fatemeh (Işık University Press, 2022)Let D = (V, A) be a finite simple digraph. A signed total double Roman dominating function (STDRD-function) on the digraph D is a function f : V (D) ? {?1, 1, 2, 3} satisfying the following conditions: (i) P x?N?(v) f(x) ... -
Upper bounds for covering total double Roman domination
Mojdeh, Doost Ali; Teymourzadeh, Atieh (Işık University Press, 2023-07)Let G = (V, E) be a finite simple graph where V = V (G) and E = E(G). Suppose that G has no isolated vertex. A covering total double Roman dominating function (CT DRD function) f of G is a total double Roman dominating ... -
Roman and inverse roman domination in network of triangles
Kumar, M. Kamal; Natarajan, Dhanasekar N.; Prasath GM, Arun; Ramadas, Giri (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). ...