Results 51 to 60 of about 488,070 (310)
Dominating Sets in Projective Planes [PDF]
Journal of Combinatorial Designs, 2016 AbstractWe describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result that shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a dominating set in a projective plane of order is smaller than (i.e., twice the size of a Baer subplane ...
Héger, Tamás, Nagy, Zoltán Lóránt
openaire +4 more sources
Fast algorithms for min independent dominating set
, 2009 We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm
D.S. Johnson +9 more
core +2 more sources
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
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou +10 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
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
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +2 more sources