Results 231 to 240 of about 72,011 (256)
Some of the next articles are maybe not open access.

Twin signed double Roman domination numbers in directed graphs

Discrete Mathematics, Algorithms and Applications, 2022
Let [Formula: see text] be a finite simple directed graph (shortly digraph). A function [Formula: see text] is called a twin signed double Roman dominating function (TSDRDF) if (i) every vertex [Formula: see text] with [Formula: see text] has at least two in-neighbor assigned a 2 or at least an in-neighbor [Formula: see text] with [Formula: see text],
Akram Mahmoodi   +2 more
openaire   +2 more sources

Roman Domination and Double Roman Domination Numbers of Sierpiński Graphs $$S(K_n,t)$$

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Sierpiński graph \(S_n^t\) can be defined recursively as \(S_n^1\cong K_n\) and one obtains \(S_n^{t+1}\) from \(S_n^t\) by replacing each vertex from \(S_n^t\) by a copy of \(K_n\) and adding some special edges between these copies of \(K_n\). Let \(G\) be a graph.
openaire   +2 more sources

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller   +2 more
exaly  

Proportion and number of cancer cases and deaths attributable to potentially modifiable risk factors in the United States

Ca-A Cancer Journal for Clinicians, 2018
Farhad Islami   +2 more
exaly  

Cancer statistics in China, 2015

Ca-A Cancer Journal for Clinicians, 2016
Rongshou Zheng   +2 more
exaly  

On the double Roman domination number in trees.

open access: closed, 2020
S. Nazari-Moghaddam, Mustapha Chellali
openalex  

Cancer treatment and survivorship statistics, 2019

Ca-A Cancer Journal for Clinicians, 2019
Kimberly D Miller   +2 more
exaly  

Bounds on the quasi total double Roman domination number in graphs

open access: closed
J. Amjadi   +4 more
openalex   +1 more source

Cancer treatment and survivorship statistics, 2016

Ca-A Cancer Journal for Clinicians, 2016
Kimberly D Miller, Angela B Mariotto
exaly  

Home - About - Disclaimer - Privacy