Results 41 to 50 of about 11,214,082 (296)
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 +5 more sources
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
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
Positive Influence Dominating Set Games
, 2014 Motivated by applications in social networks, a new type of dominating set named Positive Influence Dominating Set (PIDS) has been studied in the literature. In this paper, we investigate cooperative cost games arising from PIDS problem on social network
Jianming Yong +15 more
core +1 more source
a-t-0/spiking-neural-network-of-dominating-set-approximation: v1.0.0
, 2021 <p>Neuromorphic computing is a promising new computational paradigm that may provide energy-lean solutions to algorithmic challenges such as graph problems.
Victoria Bosch +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +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
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source