Results 41 to 50 of about 422,220 (274)
Alternative Domination in Graphs
AKCE International Journal of Graphs and CombinatoricsSometimes 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
On the domination search number
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fomin, Fedor V. +2 more
openaire +2 more sources
Graphs with Total Domination Number Double of the Matching Number
Journal of New TheoryA 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
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
Bounds on the Locating Roman Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 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
Some Results on the Strong Roman Domination Number of Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every vertex v for which f(v)=0 is
Akram Mahmoodi +2 more
doaj +1 more source
On graphs whose domination numbers equal their independent domination numbers
Electronic Notes in Discrete Mathematics, 2003 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
Belmannu Devadas Acharya, Purnima Gupta
openaire +1 more source
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
New Results in Bi- Domination in Graphs
Zanco Journal of Pure and Applied Sciences, 2022 In this paper, some new results are introduced for the bi-domination in graphs. Some properties of bi-domination number and bounds according to maximum, minimum degrees, order, and size have been determined.
M. N. Al-Harere , Athraa T. Breesam
doaj +1 more source
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
FEBS Letters, EarlyView.The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source