Results 121 to 130 of about 20,873 (148)

On the rainbow domination subdivision numbers in graphs

Asian-European Journal of Mathematics, 2016
A [Formula: see text]-rainbow dominating function (2RDF) of a graph [Formula: see text] is a function [Formula: see text] from the vertex set [Formula: see text] to the set of all subsets of the set [Formula: see text] such that for any vertex [Formula: see text] with [Formula: see text] the condition [Formula: see text] is fulfilled, where [Formula ...
Dehgardi, N., Falahat, M., Sheikholeslami, S. M., Khodkar, Abdollah   +3 more
openaire   +2 more sources

Game total domination subdivision number of a graph

Discrete Mathematics, Algorithms and Applications, 2015
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγt(G) is the minimum cardinality of a total dominating set of G. The game total domination subdivision number of a graph G is defined by the following game. Two players 𝒟 and 𝒜,
Amjadi, J., Karami, H., Sheikholeslami, S. M.   +2 more
openaire   +2 more sources

Domination number and identifying code number of the subdivision graphs

Summary: Let \(G=(V, E)\) be a simple graph. A set \(C\) of vertices of \(G\) is an identifying code of \(G\) if for every two vertices \(x\) and \(y\) the sets \(N_G[x] \cap C\) and \(N_G[y] \cap C\) are non-empty and different. Given a graph \(G,\) the smallest size of an identifying code of \(G\) is called the identifying code number of \(G\) and ...
Behtoei, Ali, Ahmadi, Somaiya, Vatandoost, Ebrahim   +2 more
openaire   +1 more source

Paired domination subdivision and multisubdivision numbers of graphs

Journal of Combinatorial Mathematics and Combinatorial Computing, 2020
The paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs.
openaire   +1 more source

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller, Leticia M Nogueira, Angela B Mariotto   +2 more
exaly  

THE DOMINATION UNIFORM SUBDIVISION NUMBER OF G◦K1

Advances in Mathematics: Scientific Journal, 2020
T. Berjin Magizha, M. K. Angel Jebitha
openaire   +1 more source

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, Ann Goding Sauer Msph, Kimberly D Miller   +2 more
exaly  

Cancer treatment and survivorship statistics, 2016

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

Cancer treatment and survivorship statistics, 2014

Ca-A Cancer Journal for Clinicians, 2014
Carol E Desantis, Angela B Mariotto, Ahmedin Jemal   +2 more
exaly  

A New Method of Estimating United States and State-level Cancer Incidence Counts for the Current Calendar Year

Ca-A Cancer Journal for Clinicians, 2007
Eric J Feuer
exaly