Results 11 to 20 of about 12,767 (290)
On the Secure Total Domination Number of Graphs [PDF]
Symmetry, 2019 A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex u ∈ V ( G ) \ D , there exists a vertex v ∈ D , which is adjacent to u, such that ( D \ { v } ) ∪ { u } is a total dominating set as well.
Abel Cabrera Martínez +2 more
openaire +2 more sources
Total domination and total domination subdivision number of a graph and its complement
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron +2 more
openaire +3 more sources
Further Results on Total Edge-Vertex Domination
Journal of Mathematics, 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
doaj +2 more sources
Total domination number of the conjunction of graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zwierzchowski, Maciej
openaire +2 more sources
On graphs for which the connected domination number is at most the total domination number
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schaudt, Oliver
openaire +3 more sources
On the Total Outer k-Independent Domination Number of Graphs
Mathematics, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez +3 more
doaj +2 more sources
Bounds on the Locating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2020 Given a graph G = (V, E) with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V has a neighbor in S. A total dominating set S is called a locating-total dominating set if for each pair of distinct vertices u ...
Wang Kun, Ning Wenjie, Lu Mei
doaj +2 more sources
On the total domination number of cross products of graphs
Discrete Mathematics, 2008 We give lower and upper bounds on the total domination number of the cross product of two graphs, γ t(G×H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles. We determine the exact values of γ t(G×Pn) and γ
Gravier, Sylvain +2 more
openaire +5 more sources
The Domination Parameters on a kind of the regular honeycomb structure [PDF]
Computer Science Journal of Moldova, 2022 The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One
Fateme Movahedi +2 more
doaj +1 more source
On upper bounds for total $k$-domination number via the probabilistic method [PDF]
, 2023 summary:For a fixed positive integer $k$ and $G=(V, E)$ a connected graph of order $n$, whose minimum vertex degree is at least $k$, a set $S\subseteq V$ is a total $k$-dominating set, also known as a $k$-tuple total dominating set, if every vertex $v\in
Cruz-Suárez, Hugo +2 more
core +1 more source