Results 121 to 130 of about 43,554 (293)
Graphs with Two Disjoint Total Dominating Sets
A total dominating set of a graph G = (V, E) is a set S of vertices such that every vertex is adjacent to a vertex in S. Define td(G) as the minimum number of edges that must be added to G to ensure a partition of V into two total dominating sets of the ...
Michael Dorfling +3 more
core
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
k-Tuple total domination and Mycieleskian graphs [PDF]
Let $k$ be a positive integer. A subset $S$ of $V(G)$ in a graph $G$ is a $k$-tuple total dominating set of $G$ if every vertex of $G$ has at least $k$ neighbors in $S$.
Adel P. Kazemi
doaj
Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj +3 more
wiley +1 more source
ANALISA LOCATING TOTAL DOMINATING SET PADA GRAF KHUSUS DAN GRAF HASIL OPERASI AMALGAMAS [PDF]
Teori graf pertama kalo dikenalkan pada tahun 1735 oleh seorang matematikawan bernama Leonhard Euler yang berasal dari Swiss. Teori graf merupakan salah satu cabang matematika diskrit yang digunakan untuk menggambarkan suatu persoalan agar lebih mudah
SARI, Masnita Novita
core
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
A total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. We show that given a graph of order n with minimum degree at least 2, one can add at most (n-2n)/4+O(logn) edges such that the resulting ...
Dorfling, Michael +7 more
core +1 more source
Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn +4 more
wiley +1 more source
Locating Total Dominating Sets in the Join, Corona and Composition of Graphs
which is also a total dominating set is called a locating total dominating set of G. The minimum cardinality of a locating total dominating set of G is called the locating total domination number of G.
Benjamin N Omamalin +2 more
core

