Results 51 to 60 of about 14,233,339 (289)
Total 2-rainbow domination numbers in trees
Discussiones Mathematicae Graph Theory, 2021 A function \(f:V(G) \rightarrow 2^{\{1,2\}}\) is a \(2\)-rainbow dominating function (2RDF) of a graph \(G\) if for every vertex \(v\) with \(f(v) = \emptyset\) we have \(\cup_{u\in N(v)} f(u) = \{1,2\}\). A 2RDF \(f\) is a total 2-rainbow dominating function (T2RDF) if the subgraph induced by the vertices \(v\) with \(f(v) \ne \emptyset\) has no ...
Ahangar H. Abdollahzadeh +4 more
openaire +3 more sources
Graphs with Total Domination Number Double of the Matching Number
Journal of New TheoryA subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj +1 more source
On the inverse signed total domination number in graphs [PDF]
Opuscula Mathematica, 2017 In this paper, we study the inverse signed total domination number in graphs and present new sharp lower and upper bounds on this parameter. For example by making use of the classic theorem of Turán (1941), we present a sharp upper bound on \(K_{r+1 ...
D. A. Mojdeh, B. Samadi
doaj +1 more source
On the domination number and the total domination number of Fibonacci cubes
Ars Mathematica Contemporanea, 2019 Summary: Fibonacci cubes are special subgraphs of the hypercube graphs. Their domination numbers and total domination numbers are obtained for some small dimensions by integer linear programming. For larger dimensions upper and lower bounds on these numbers are given.
openaire +7 more sources
Total restrained domination numbers of trees
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joanna Raczek, Joanna Cyman
openaire +1 more source
New Bounds on the Signed Total Domination Number of Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥
Moghaddam Seyyed Mehdi Hosseini +3 more
doaj +1 more source
Outer independent total double Italian domination number [PDF]
Computer Science Journal of MoldovaIf $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
Minimum Randić Index of Trees with Fixed Total Domination Number
Mathematics, 2022 The Randić index is among the most famous degree-based topological indices in chemical graph theory. It was introduced due to its application in modeling the properties of certain molecular structures and has been extensively studied.
Ayu Ameliatul Shahilah Ahmad Jamri +4 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
Total Roman Domination Number of Rooted Product Graphs
Mathematics, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +1 more source