Results 21 to 30 of about 12,796 (264)
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 ...
Azarija, Jernej +2 more
openaire +3 more sources
Trees with equal total domination and game total domination numbers
Discrete Applied Mathematics, 2017 23 pages, 5 figures, 22 ...
Henning, Michael A., Rall, Douglas F.
openaire +3 more sources
On Total Vertex-Edge Domination [PDF]
, 2018 A novel domination invariant defined by Boutrig and Chellali in the recent: total vertex-edge domination. In this paper we obtain an improved upper bound of total vertex edge-domination number of a tree. If is a connected tree with order , then with and we characterize the trees attaining this upper bound.
Şahin B., Şahin A.
openaire +8 more sources
Total domination versus paired domination [PDF]
Discussiones Mathematicae Graph Theory, 2012 A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices. The minimal size of a total dominating set, the total domination number, is denoted by t.
openaire +2 more sources
Equality of total domination and chromatic total domination in graphs
International journal of health sciences, 2022 Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is said to be dominating set if for every in there exist a vertex in such that and are adjacent. The minimum cardinality of a dominating set of is called the domination number of and is denoted by .
M. Angala Eswari, S. Balamurugan
openaire +1 more source
Further Results on the Total Roman Domination in Graphs
Mathematics, 2020 Let G be a graph without isolated vertices. A function f : V ( G ) → { 0 , 1 , 2 } is a total Roman dominating function on G if every vertex v ∈ V ( G ) for which f ( v ) = 0 is adjacent to at least one vertex u ...
Abel Cabrera Martínez +2 more
doaj +1 more source
Disjunctive total domination in graphs [PDF]
Journal of Combinatorial Optimization, 2014 Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $ _t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $
Henning, Michael A., Naicker, Viroshan
openaire +3 more sources
Bounds on Global Total Domination in Graphs [PDF]
Computer Science Journal of Moldova, 2015 A subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS, if $S$ is a \textit{total dominating set} of both $G$ and $\overline{G}$.
Nader Jafari Rad, Elahe Sharifi
doaj
Total [1,2]-domination in Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2018 17 ...
Lv, Xue-Zheng, Wu, Baoyindureng
openaire +2 more sources
Total Domination in Partitioned Graphs [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frendrup, Allan +2 more
openaire +3 more sources