Results 71 to 80 of about 6,626,501 (294)
Edge colorings and total colorings of integer distance graphs
An integer distance graph is a graph \(G(D)\) with vertex set the set \(\mathbb{Z}\) of integers and two vertices \(u,v\in \mathbb{Z}\) adjacent if and only if \(|u-v|\in D\), where the distance set \(D\) is a subset of the set of positive integers \(\mathbb{N}\).
Arnfried Kemnitz, Massimiliano Marangio
openaire +3 more sources
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Single Valued Neutrosophic Coloring [PDF]
Neutrosophic set was introduced by Smarandache in 1998. Due to some real time situation, decision makers deal with uncertainty and inconsistency to identify the best result.
A. Rohini +3 more
doaj +1 more source
On total colorings of 1-planar graphs [PDF]
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Xin Zhang 0017 +2 more
openaire +3 more sources
Synechocystis strains deficient in succinate dehydrogenase (SDH) secrete more succinate than the WT under dark anaerobic conditions, supporting that SDH then primarily acts as SDH, not as a fumarate reductase. L‐aspartate oxidase (Laspo) from Synechocystis is functional under anaerobic conditions, reducing fumarate to succinate.
Kateryna Kukil +3 more
wiley +1 more source
Facial [r,s,t]-Colorings of Plane Graphs
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
On the total coloring of planar graphs.
By Behzad and Vizing's conjecture (1968), \(\kappa_ t(G)\leq \Delta (G)+2\), where \(\kappa_ t(G)\) is the total chromatic number and \(\Delta\) (G) - the maximal degree of a graph G. For planar graphs G it is proved here that \(\kappa_ t(G)\leq \Delta (G)+2\) if \(\Delta\) (G)\(\not\in \{6,7,8\}\), \(\kappa_ t(G)\leq \Delta (G)+3\) always, and ...
openaire +2 more sources
Artificial molecular machines and motors—Design and control of nanoscale motion
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source

