Results 31 to 40 of about 94,998 (262)

Connected Tropical Subgraphs in Vertex-Colored Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph.
Jean-Alexandre Anglès d'Auriac   +5 more
doaj   +1 more source

Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target

open access: yesFEBS Letters, EarlyView.
This study shows Plasmodium falciparum GEP1 is vital for activating sexual stages of malarial parasites even independently of a mosquito factor. Knockout parasites completely fail gamete formation even when a phosphodiesterase inhibitor is added. Two single‐nucleotide polymorphisms (V241L and S263P) are found in 12%–20% of field samples.
Frederik Huppertz   +5 more
wiley   +1 more source

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

open access: yesFEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

Complement of the generalized total graph of fields

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj   +1 more source

Seidel Integral Complete Split Graphs [PDF]

open access: yesMathematics Interdisciplinary Research, 2019
In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic   +2 more
doaj   +1 more source

Multi‐omic characterization of consensus molecular subtype 1 (CMS1) colorectal cancer with dampened immune response improves precision medicine

open access: yesMolecular Oncology, EarlyView.
This study highlights the importance of multi‐omic analyses in characterizing colorectal cancers. Indeed, our analysis revealed a rare CMS1 exhibiting dampened immune activation, including reduced PD‐1 expression, moderate CD8+ T‐cell infiltration, and suppressed JAK/STAT pathway.
Livia Concetti   +10 more
wiley   +1 more source

Splitting Cubic Circle Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj   +1 more source

OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS

open access: yesUral Mathematical Journal, 2020
Let \(G\) be a graph with the vertex set \(V(G)\).  A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\)  The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj   +1 more source

Chemoresistome mapping in individual breast cancer patients unravels diversity in dynamic transcriptional adaptation

open access: yesMolecular Oncology, EarlyView.
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani   +14 more
wiley   +1 more source

Packing chromatic number of certain fan and wheel related graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
The packing chromatic number of a graph is the smallest integer for which there exists a mapping such that any two vertices of color are at distance at least .
S. Roy
doaj   +1 more source

Home - About - Disclaimer - Privacy