Results 41 to 50 of about 43,787 (293)
Certain Properties of Domination in Product Vague Graphs With an Application in Medicine
Frontiers in Physics, 2021 The product vague graph (PVG) is one of the most significant issues in fuzzy graph theory, which has many applications in the medical sciences today.
Xiaolong Shi, Saeed Kosari
doaj +1 more source
A characterization of graphs with disjoint total dominating sets
Ars Mathematica Contemporanea, 2019 Summary: A set \(S\) of vertices in a graph \(G\) is a total dominating set of \(G\) if every vertex is adjacent to a vertex in \(S\). A fundamental problem in total domination theory in graphs is to determine which graphs have two disjoint total dominating sets.
Michael A. Henning, Iztok Peterin
openaire +4 more sources
On the number of minimum dominating sets and total dominating sets in forests
Journal of Graph TheoryAbstractWe show that the maximum number of minimum dominating sets of a forest with domination number is at most and construct for each a tree with domination number that has more than minimum dominating sets. Furthermore, we disprove a conjecture about the number of minimum total dominating sets in forests by Henning, Mohr and Rautenbach.
Jan Petr, Julien Portier, Leo Versteegen
openaire +4 more sources
Bounds on weak and strong total domination in graphs
Electronic Journal of Graph Theory and Applications, 2016 A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V-D$ is adjacent to a vertex $u\in D$ such that$d_{G}(v)
M.H. Akhbari, Nader Jafari Rad
doaj +1 more source
Total Efficient Domination in Fuzzy Graphs
IEEE Access, 2019 This study proposed total efficient domination in fuzzy graphs. The exact values on the total efficient domination number for several classes of fuzzy graphs are determined.
Xue-Gang Chen +2 more
doaj +1 more source
Approximation hardness of dominating set problems [PDF]
, 2004 We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected and directed graphs. We state the first explicit approximation lower bounds for various kinds of domination problems (connected, total, independent) in ...
Chlebikova, Janka +5 more
core +1 more source
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 +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source
Dominating Set Dan Total Dominating Set Dari Graf-Graf Khusus [PDF]
, 2015 $Dominating$ $number$ $\gamma (G)$ adalah kardinalitas terkecil dari sebuah $do\-mi\-na\-ting$ $set$. Nilai dari $dominating$ $number$ selalu $\gamma (G)\subseteq V(G)$.
Dwi Agustin Retno Wardani; Ika Hesti Agustin;Dafik
core
Chemical Reaction Optimization for Minimum Weight Dominating Set [PDF]
, 2023 Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
B. Md. Rafiqul Islam +1 more
core +1 more source