Results 51 to 60 of about 1,605,758 (310)
A study on roman domination lower deg-centric graphs
Journal of Combinatorial Mathematics and Combinatorial ComputingThe lower deg-centric graph of a simple, connected graph \(G\), denoted by \(G_{ld}\), is a graph constructed from \(G\) such that \(V(G_{ld}) = V(G)\) and \(E(G_{ld}) = \{v_iv_j: d_G(v_i,v_j) < \deg_G(v_i)\}\).
Timmy Tomy Thalavayalil
semanticscholar +1 more source
On the total Roman domination in trees
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amjadi Jafar +2 more
openaire +2 more sources
Angewandte Chemie, EarlyView.Guest transport across metal–organic framework (MOF) single crystals disentangles transport occurring through the micropores from contributions at grain boundaries. Even guest molecules with identical kinetic diameters show drastically different transport behavior arising from the distinct modes of adsorption. Neither pore clogging nor surface collapse
Hochul Woo +2 more
wiley +2 more sources
Triple Roman domination subdivision number in graphs [PDF]
Computer Science Journal of Moldova, 2022 For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)\longrightarrow\{0, 1, 2, 3, 4\}$ having the property that for any vertex $v\in V(G)$, if $f(v)
Jafar Amjadi, Hakimeh Sadeghi
doaj
Independent Double Roman Domination Stability in Graph
European Journal of Pure and Applied MathematicsAn independent double Roman dominating function (IDRD-function) on a graph $G$ is a function $f :V(G)\to \{0, 1, 2, 3\}$ having the property that (i) if $f(v) = 0$, then the vertex $v$ must have at least two neighbors assigned 2 under $f$ or one neighbor
Jamil J. Hamja +4 more
semanticscholar +1 more source
On the co-Roman domination in graphs
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zehui Shao +4 more
openaire +2 more sources
Roman Domination in Complementary Prism Graphs [PDF]
, 2012 A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core
The Interplay of Curvature, Geometry, and Topology Shapes Tissue Organisation in Epithelial Shells
Advanced Science, EarlyView.Purely geometric 3D Voronoi models predict the organisation of epithelial shells. The interplay of curvature, geometry, and topology enriches the number of pentagons in shells with lower number of cells. Small MDCK cysts and Mouse embryos match the top polygonal configurations in a compactness‐based ranking derived from the Voronoi model. In conclusion,
Laura Morato +9 more
wiley +1 more source
Advanced Science, EarlyView.By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu +11 more
wiley +1 more source
Some Progress on the Double Roman Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V,E), a double Roman dominating function (or just DRDF) is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0 for a vertex v, then v has at least two neighbors assigned 2 under f or one neighbor assigned 3 under f, and ...
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source