Results 51 to 60 of about 51,346 (268)

Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs

Ratio Mathematica, 2023
If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj   +1 more source

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

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, Shin Morioka, Junko Sasaki, Takehiko Sasaki   +3 more
wiley   +1 more source

Speaker Clustering Using Dominant Sets [PDF]

2018 24th International Conference on Pattern Recognition (ICPR), 2018
Speaker clustering is the task of forming speaker-specific groups based on a set of utterances. In this paper, we address this task by using Dominant Sets (DS). DS is a graphbased clustering algorithm with interesting properties that fits well to our problem and has never been applied before to speaker clustering.
Hibraj, Feliks, Vascon, Sebastiano, Stadelmann, Thilo, Pelillo, Marcello   +3 more
openaire   +2 more sources

Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees

Discussiones Mathematicae Graph Theory, 2018
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj   +1 more source

Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]

Opuscula Mathematica
A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
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, Catherine S. Palmer, Jacqueline M. Kimmey   +2 more
wiley   +1 more source

Dominant Sets for “Constrained” Image Segmentation [PDF]

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2019
Image segmentation has come a long way since the early days of computer vision, and still remains a challenging task. Modern variations of the classical (purely bottom-up) approach, involve, e.g., some form of user assistance (interactive segmentation) or ask for the simultaneous segmentation of two or more images (co-segmentation).
Eyasu Zemene Zemene, Leulseged Tesfaye Alemu, Marcello Pelillo   +2 more
openaire   +3 more sources

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

FEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang, Satoshi Hashimoto, Sota Ito, Chisato Kikuguchi, Miho Hoshi, Kiyoshi Yamaguchi, Yoichi Furukawa, Toru Suzuki, Toshifumi Inada   +8 more
wiley   +1 more source

Edge Dominating Sets and Vertex Covers

Discussiones Mathematicae Graph Theory, 2013
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

FEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source