Results 71 to 80 of about 7,400,368 (352)
False alarms in fault-tolerant dominating sets in graphs [PDF]
Opuscula Mathematica, 2012 We develop the problem of fault-tolerant dominating sets (liar's dominating sets) in graphs. Namely, we consider a new kind of fault - a false alarm.
Mateusz Nikodem
doaj +1 more source
Power domination in maximal planar graphs [PDF]
, 2019 Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.
Dorbec, Paul +2 more
core +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül +2 more
wiley +1 more source
Proper 3-Dominating Sets in Graphs
MathematicsA dominating set is a classic concept that is widely used in road safety, disaster rescue operations, and chemical graphs. In this paper, we introduce a variation of the dominating set: the proper 3-dominating set.
Danmei Chen, Shuangjie Cai
doaj +1 more source
Dominating Vertex Covers: The Vertex-Edge Domination Problem
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +1 more source
Independent Dominating Set on Chain of Fuzzy Graphs
Tikrit Journal of Pure Science, 2023 In this paper, we applied some properties on chain fuzzy graphs, which comprise vertex identification. These properties are independent sets and independent dominant sets.
Russel H. Majeed, Nabeel E. Arif
doaj +1 more source
A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs
International Joint Conference on Artificial Intelligence, 2018 The minimum weight dominating set (MWDS) problem is NP-hard and also important in many applications. Recent heuristic MWDS algorithms can hardly solve massive real world graphs effectively.
Yiyuan Wang +3 more
semanticscholar +1 more source
Locating-dominating sets in hypergraphs [PDF]
Periodica Mathematica Hungarica, 2016 A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated.
Fazil, Muhammad +3 more
openaire +3 more sources
Reciprocal control of viral infection and phosphoinositide dynamics
FEBS Letters, EarlyView.Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
On Locating-Dominating Set of Regular Graphs
Journal of Mathematics, 2021 Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source