Results 31 to 40 of about 7,042,445 (296)
Further Results on Total Edge-Vertex Domination
, 2022 Total edge-vertex domination is a new total domination-type parameter. In this paper, the author shows that determining the total edge-vertex domination number in bipartite planar graphs is NP-complete.
Abdulgani Şahin
core +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Trees with equal total domination and game total domination numbers
Discrete Applied Mathematics, 2017 In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are ...
Michael A. Henning, Douglas F. Rall
openaire +4 more sources
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]
, 2000 summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Wei, Bing +7 more
core +1 more source
Ars Mathematica Contemporanea, 2021 A subset of vertices in a graph is called a total dominating set if every vertex of the graph is adjacent to at least one vertex of this set. A total dominating set is called minimal if it does not properly contain another total dominating set. In this paper, we study graphs whose all minimal total dominating sets have the same size, referred to as ...
Selim Bahadir +2 more
openaire +7 more sources
Total Domination Versus Domination in Cubic Graphs [PDF]
Graphs and Combinatorics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joanna Cyman +4 more
openaire +3 more sources
Weak Domination In semi total Block graph
, 2023 weak domination in Semi total Block graph, Domination number in graph ...
sana Aejaz (16545906)
core +1 more source
Total Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +1 more source
Jambura Journal of Mathematics, 2022 Let G = (V(G), E(G)) be a connected graph, where V(G) is the set of vertices and E(G) is the set of edges. The set Dt(G) is called the total domination set in G if every vertex v 2 V(G) is adjacent to at least one vertex in Dt (G).
Nurhamzah Nurhamzah +2 more
doaj +1 more source