Results 51 to 60 of about 3,087,593 (348)
Some Covering and Packing Problems for Mixed Triples
A mixed graph has both edges and directed edges (or “arcs”). A complete mixed graph on v vertices, denoted Mv, has, for every pair of vertices u and v, an edge {u,v}, an arc (u,v), and an arc (v,u).
Benkam Bobga, Robert Gardner
doaj +1 more source
Extremal graphs with maximum complementary second Zagreb index
The complementary second Zagreb index of a graph $ G $ is defined as $ cM_{2}(G) = \sum_{uv \in E(G)} |d_{G}(u)^{2}-d_{G}(v)^{2}| $. In this paper, we prove that a graph having maximum complementary second Zagreb index among all graphs of order $ n $ is
Hui Gao
doaj +1 more source
Studying individual trees is a common way that scientists employ to study forests and estimate forest parameters. In this study, a graph-based approach was developed for detecting individual trees in a broadleaf, complex forest region based on UAV ...
S. A. Ahmadi +4 more
semanticscholar +1 more source
Integral Mixed Unit Interval Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Le, Van Bang, Rautenbach, Dieter
openaire +2 more sources
Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target
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
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
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source
Uniform Mixing on Cayley Graphs
We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}_3^d$ that admit uniform mixing at time $2\pi/9$. Our second result shows that for every integer $k\ge 3$, we can construct Cayley graphs over $\mathbb{Z}_q^d ...
Godsil, Chris, Zhan, Hanmeng
openaire +3 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
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 +8 more
wiley +1 more source
Colourings of $(m, n)$-coloured mixed graphs [PDF]
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray +2 more
doaj +1 more source

