Results 41 to 50 of about 11,901,808 (241)
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
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
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani +7 more
wiley +1 more source
Referral Patterns and Diagnostic Timeliness in Pediatric Cancer: A Hospital‐Based Study in Indonesia
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Timely diagnosis and treatment are critical for improving survival among children with cancer. In low‐ and middle‐income countries (LMICs), delays are common and may be influenced by fragmented referral pathways and diagnostic limitations.
Nur Melani Sari +5 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
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric intramedullary low‐grade gliomas (PIMLGGs) are rare neoplasms that present unique clinical and management challenges. Although surgery remains the primary tool for tissue diagnosis and decompression, complete gross‐total resection is frequently unfeasible due to the infiltrative nature of these lesions.
Olga M. Sergeenko +5 more
wiley +1 more source
Total dominator color class total dominating sets in ladder and mobius ladder graph
Malaya Journal of Matematik, 2021 Let $G$ be a finite, undirected and connected graph with minimum degree at least one. A proper coloring $\mathcal{C}$ of $G$ is said to be a total dominator color class total dominating set of $G$ if each vertex properly dominates a color class in $\mathcal{C}$ and each color class in $\mathcal{C}$ is properly dominated by a vertex in $\mathrm{V ...
null A. Vijayalekshmi, null S. Abisha
openaire +1 more source