Results 21 to 30 of about 16,468 (299)
Remarks on restrained domination and total restrained domination in graphs [PDF]
, 2005 summary:The restrained domination number $\gamma ^r (G)$ and the total restrained domination number $\gamma ^r_t (G)$ of a graph $G$ were introduced recently by various authors as certain variants of the domination number $\gamma (G)$ of $(G)$.
Zelinka, Bohdan
core +4 more sources
On graphs with equal total domination and Grundy total domination numbers
Aequationes mathematicae, 2021 A sequence $(v_1,\ldots ,v_k)$ of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v_i$ in the sequence totally dominates at least one vertex that was not totally dominated by $\{v_1,\ldots , v_{i-1}\}$ and $\{v_1,\ldots ,v_k\}$ is a total dominating set of $G$.
Tanja Dravec +3 more
openaire +2 more sources
Secure Total Domination in Rooted Product Graphs
Mathematics, 2020 In this article, we obtain general bounds and closed formulas for the secure total domination number of rooted product graphs. The results are expressed in terms of parameters of the factor graphs involved in the rooted product.
Abel Cabrera Martínez +2 more
doaj +1 more source
An upper bound on the total outer-independent domination number of a tree [PDF]
Opuscula Mathematica, 2012 A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of \(G\) such that every vertex of \(G\) has a neighbor in \(D\), and the set \(V(G) \setminus D\) is independent.
Marcin Krzywkowski
doaj +1 more source
Total dominator total coloring of a graph
Contributions to Discrete Mathematics, 2023 Here, we initiate to study the total dominator total coloring of a graph which is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. In more details, while in section 2 we present some tight lower and upper bounds for the total dominator total chromatic number of a graphs in ...
Adel P. Kazemi +2 more
openaire +2 more sources
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
The Electronic Journal of Combinatorics, 2017 Using hypergraph transversals it is proved that $\gamma_t(Q_{n+1}) = 2\gamma(Q_n)$, where $\gamma_t(G)$ and $\gamma(G)$ denote the total domination number and the domination number of $G$, respectively, and $Q_n$ is the $n$-dimensional hypercube. More generally, it is shown that if $G$ is a bipartite graph, then $\gamma_t(G \square K_2) = 2\gamma(G ...
Jernej Azarija +2 more
openaire +3 more sources
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
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
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 +3 more sources