Results 51 to 60 of about 8,731,938 (294)
On the domination number and the total domination number of Fibonacci cubes
Summary: Fibonacci cubes are special subgraphs of the hypercube graphs. Their domination numbers and total domination numbers are obtained for some small dimensions by integer linear programming. For larger dimensions upper and lower bounds on these numbers are given.
openaire +7 more sources
Results on the domination number and the total domination number of Lucas cubes
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
Product throttling for power domination [PDF]
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Alternative Domination in Graphs
Sometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj +1 more source
Graphs with Total Domination Number Double of the Matching Number
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj +1 more source
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
Bounds on the Locating Roman Domination Number in Trees
A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(
Jafari Rad Nader, Rahbani Hadi
doaj +1 more source
ABSTRACT Introduction Physical rehabilitation is highly recognised in improving the quality of life of cancer survivors through prehabilitation, sequelae management and palliative care, yet its integration into routine care in Ghana has not been characterised, leading to potential gaps in service access.
Dorothy Ekua Adjabu +5 more
wiley +1 more source
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
On graphs whose domination numbers equal their independent domination numbers
Abstract In this paper, we extend a result due to R. B. Allan and R. C. Laskar on graphs whose independent domination numbers equal their domination numbers. We will consider finite simple graphs as treated in most of the standard text-books on Graph Theory (e.g., see D. B. West [1]). Let G = (V,E) be any graph and D ⊆ V. We let N(D) denote the set
B. Devadas Acharya, Purnima Gupta
openaire +2 more sources

