Results 11 to 20 of about 9,316,109 (203)

Signed double Roman domination on cubic graphs [PDF]

, 2023
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
Iurlano, Enrico, Zec, Tatjana, Raidl, Günther R., Djukanovic, Marko, Zec, Tatjana; orcid:, Raidl, Günther R.; orcid:, Iurlano, Enrico; orcid:, Djukanovic, Marko; orcid:   +7 more
core   +3 more sources

Singed Total Domatic Number of a Graph [PDF]

, 2010
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol, Walikar, H.B., Kishori P.Narayankar   +2 more
core   +1 more source

Several Roman domination graph invariants on Kneser graphs [PDF]

, 2023
This paper considers the following three Roman domination graph invariants on Kneser graphs: Roman domination, total Roman domination, and signed Roman domination.
Milana Grbić, Zec, Tatjana, Grbić, Milana, Tatjana Zec   +3 more
core   +1 more source

Signed Total Roman Domination in Digraphs [PDF]

, 2017
Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz, Volkmann, Lutz
core   +1 more source

Signed Total Roman Edge Domination In Graphs [PDF]

, 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 ...
Sheikholeslami, Seyed Mahmoud, Sheikholeslami Seyed Mahmoud, Leila Asgharsharghi, Asgharsharghi, Leila, Asgharsharghi Leila, Seyed Mahmoud Sheikholeslami   +5 more
core   +1 more source

Bounds on the total double Roman domination number of graphs [PDF]

, 2023
Let $G$ be a simple graph with no isolated vertex and let $\gamma_{tdR}(G)$ be the total double Roman domination number of $G$. In this paper, we present lower and upper bounds on $\gamma_{tdR}(G)$ of a graph $G$ in terms of the order, open packing ...
Xie, Zhihong, Hajjari, Maryam, Zhihong Xie, Seyed Mahmoud Sheikholeslami, Sheikholeslami, Seyed Mahmoud, M. Hajjari, Guoliang Hao, Hao, Guoliang   +7 more
core   +1 more source

On signed majority total domination in graphs [PDF]

, 2005
summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$.
Sun, Liang, Chen, Xue-Gang, Xing, Hua-Ming   +2 more
core   +1 more source

Site Density Governs Switching Reactivity Regimes During Aerobic C─H Oxidation in Mn Single‐Atom Photocatalysts

Angewandte Chemie, EarlyView.
Increasing the density of isolated manganese (Mn) atoms in carbon nitride (CNx) photocatalysts does not continuously improve performance. Instead, beyond a critical loading, the polymer support reorganizes, altering charge‐carrier dynamics and oxygen activation while preserving atomic dispersion.
Viktoria Velichko, Agustín de Arriba, Areti Moutsiou, Elisabetta Inico, Andrea Olivati, Berta Pérez‐Román, Jesús López‐Sánchez, Ik Seon Kwon, Andrea Tonelli, Abhijit Roy, Valentina De Renzi, Raul Arenal, Annamaria Petrozza, Carlo Cavallotti, Gianvito Vilé   +14 more
wiley   +2 more sources

Bounds on the global double Roman domination number in graphs [PDF]

, 2022
Let $G$ be a simple graph of order $n$ and let $\gamma_{gdR}(G)$ be the global double Roman domination number of $G$. In this paper, we give some upper bounds on the global double Roman domination number of $G$.
Seyed Mahmoud Sheikholeslami, Chen, Xiaodan, Xiaodan Chen, Sheikholeslami, Seyed Mahmoud, Shouliu Wei, Guoliang Hao, Wei, Shouliu, Hao, Guoliang   +7 more
core   +1 more source

Double Roman and double Italian domination [PDF]

, 2023
Let $G$ be a graph with vertex set $V(G)$. A double Roman dominating function (DRDF) on a graph $G$ is a function \( f:V(G)\longrightarrow\{0,1,2,3\} \) that satisfies the following conditions: (i) If $f(v)=0$, then $v$ must have a neighbor $w$ with $f(w)
Volkmann, Lutz, Lutz Volkmann
core   +1 more source