Results 41 to 50 of about 14,233,339 (289)
Total domination game on ladder graphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 The total domination game is played on a simple graph G by two players, named Dominator and Staller. They alternately select a vertex of G; each chosen vertex totally dominates its neighbors.
Karnchana Charoensitthichai +1 more
doaj +1 more source
Bounding the k-rainbow total domination number [PDF]
Discrete Mathematics, 2021 Recently the notion of $k$-rainbow total domination was introduced for a graph $G$, motivated by a desire to reduce the problem of computing the total domination number of the generalized prism $G \Box K_k$ to an integer labeling problem on $G$. In this paper we further demonstrate usefulness of the labeling approach, presenting bounds on the rainbow ...
Kerry Ojakian +2 more
openaire +3 more sources
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 +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
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 +2 more sources
Total dominator total chromatic numbers of cycles and paths
RAIRO - Operations Research, 2023 The total dominator total coloring of a graph is a total coloring of the graph such that each object (vertex or edge) of the graph is adjacent or incident to every object of some color class. The minimum number of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. In (A.P.
Adel P. Kazemi, Farshad Kazemnejad
openaire +3 more sources
Results on the domination number and the total domination number of Lucas cubes
Ars Mathematica Contemporanea, 2020 Summary: Lucas cubes are the special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we present the exact values of total domination number of small dimensional Lucas cubes and present ...
openaire +2 more sources
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core +3 more sources
On signed majority total domination in graphs [PDF]
, 2005 summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$.
Sun, Liang +2 more
core +1 more source
On the Quasi-Total Roman Domination Number of Graphs
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
doaj +1 more source