Results 41 to 50 of about 838 (256)
Analysis of the presence of Eastern elements in Frankenstien Mary Shelly [PDF]
ادبیات تطبیقی, 2021 1. Introduction The valuable Frankenstein or Modern Prometheus novel written by Mary Shelley in the early nineteenth century is a Gothic-style science-fiction.
Najmeh Dorri, Shabnam Amiri
doaj +1 more source
Total Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +1 more source
Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs [PDF]
, 2022 For a given graph G without isolated vertex we consider a function f : V (G) -> {0,1, 2}. For every i is an element of {0,1, 2}, let V-i = {v is an element of V (G) : f (v) = i}.
González Yero, Ismael +2 more
core +1 more source
Quasi-total Roman bondage number in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex ...
Huiqin Jiang, Zehui Shao
doaj +1 more source
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
Closed formulas for the total Roman domination number of lexicographic product graphs [PDF]
, 2021 Let G be a graph with no isolated vertex and f: V(G) → {0, 1, 2} a function. Let Vi = {x ∈ V(G) : f(x) = i} for every i ∈ {0, 1, 2}. We say that f is a total Roman dominating function on G if every vertex in V0 is adjacent to at least one vertex in V2 ...
Cabrera Martínez, Abel +1 more
core +1 more source
Roman Edge Semi-Total Block Domination of a Graph
Asia Pacific Journal of Mathematics, 2018 Summary: A graph \(G=(V,E)\), semi-total block graph \(T_b(G)=H\), whose set of vertices is the union of the set of vertices and blocks of \(G\) in whose two vertices are adjacent if and only if the corresponding vertices and blocks of \(G\) are adjacent or the corresponding members are incident.
Girish V.R., P. Usha
doaj +3 more sources
Total restrained Roman domination
, 2022 Published by Azabaijan Shahid Madani University, Azarshahr ...
Amjadi, Jafar +2 more
openaire +3 more sources
A Borane Sandwich Analogue of Ferrocene
Angewandte Chemie, EarlyView.The first ferrocene analogue with two boron‐based ligands is identified through a global exploration of the FeB10H20 potential energy surface. The η5,η5‐Fe(B5H10)2 complex emerges as the global minimum, showing that metal coordination inverts borane stability and enables aromatic boron rings inaccessible in isolation.
Viviana Roman‐Ventura +8 more
wiley +2 more sources
Roman domination in direct product graphs and rooted product graphs1 [PDF]
, 2021 Let G be a graph with vertex set V(G). A function f : V(G) -> {0, 1, 2) is a Roman dominating function on G if every vertex v is an element of V(G) for which f(v) = 0 is adjacent to at least one vertex u is an element of V(G) such that f(u) = 2.
González Yero, Ismael +3 more
core +1 more source