Results 71 to 80 of about 1,370 (272)
The signed Roman domatic number of a digraph
Electronic Journal of Graph Theory and Applications, 2015 Let $D$ be a finite and simple digraph with vertex set $V(D)$.A {\em signed Roman dominating function} on the digraph $D$ isa function $f:V (D)\longrightarrow \{-1, 1, 2\}$ such that$\sum_{u\in N^-[v]}f(u)\ge 1$ for every $v\in V(D)$, where $N^-[v ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
Modern Roman Dominating Functions In Graphs
European Journal of Pure and Applied MathematicsLet $G=(V(G), E(G))$ be any connected graph. A function $f:V(G) \to \{0,1,2,3\}$ is a modern Roman dominating function of $G$ if for each $v\in V(G)$ with $f(v)=0$, there exist $u,w \in N_G (v)$ such that $f(u)=2$ and $f(w)=3$; and for each $v\in V(G)$ with $f(v)=1$, there exists $u \in N_G (v)$ such that $f(u)=2$ or $f(w)=3$.
Sherihatha Ahamad +2 more
openaire +1 more source
On the upper Bound of double Roman dominating function
, 2019 A double Roman Dominating function on a graph $G$ is a function $ f:V\rightarrow \{0,1,2,3\}$ such that the following conditions hold. If $f(v)=0$, then vertex $v$ must have at least two neighbors in $V_2$ or one neighbor in $V_3$ and if $f(v)=1$, then vertex $v$ must have at least one neighbor in $V_2\bigcup V_3$.
Teimourzadeh, Atieh, Mojdeh, Doost Ali
openaire +2 more sources
On The Total Roman Domination in Trees
Discussiones Mathematicae Graph Theory, 2019 A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by ...
Amjadi Jafar +2 more
doaj +1 more source
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
, 2003 A Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2.
Paul A Dreyer +7 more
core +1 more source
Signed Total Roman Edge Domination In Graphs
Discussiones Mathematicae Graph Theory, 2017 Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open ...
Asgharsharghi Leila +1 more
doaj +1 more source
The Anatomical Record, EarlyView.Abstract Domesticated European rabbits (Oryctolagus cuniculus) have long been chosen as laboratory model organisms. Despite this, there has been no definitive study of the vertebral musculature of wild rabbits. Relevant descriptions of well‐studied veterinary model mammals (such as dogs) are generally applicable, but not appropriate for a species ...
Nuttakorn Taewcharoen +3 more
wiley +1 more source
, 2016 For a graph G=(V,E), a double Roman dominating function is a function f:V→{0,1,2,3} having the property that if f(v)=0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f(w)=3, and if f(v)=1, then vertex v must have ...
Haynes, Teresa W. +2 more
core +1 more source
The Anatomical Record, EarlyView.Abstract A recent debate has emerged between Caspar et al. (2024) and Herculano‐Houzel (2023) on inferring extinct dinosaur cognition by estimating brain neuron counts. While thought‐provoking, the discussion largely overlooks the function of cognition, as well as partly neglects the difficulties involved in estimating neuron numbers, which according ...
Thomas Rejsenhus Jensen +7 more
wiley +1 more source