Results 131 to 140 of about 3,489,698 (302)
On the Line Graph of the Complete Bipartite Graph
The Annals of Mathematical Statistics, 1964 In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question had been settled by Shrikhande [5] (see also [1], [2] and [3]), who proved that the answer was yes ...
openaire +3 more sources
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
FEBS Open Bio, EarlyView.Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Treewidth is NP-Complete on Cubic Graphs [PDF]
In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Tree-width is NP-complete on graphs with maximum degree at most 9.
Lima, Paloma T. +9 more
core +2 more sources
Orientable Vertex Transitive Embeddings of Complete Graphs
AxiomsThis paper investigates the enumeration of orientable vertex-transitive embeddings of complete graphs Kp2, where p≥5 is a prime. Building on the classification framework established by Li, we derive a precise count of these embeddings up to non ...
Xue Yu, Bengong Lou
doaj +1 more source
FEBS Open Bio, EarlyView.Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata +3 more
wiley +1 more source
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core
Type I interferons modulate autophagy to shape gemcitabine response in pancreatic cancer cells
FEBS Open Bio, EarlyView.Type I interferons differentially modulate autophagy and the response of pancreatic cancer cells to gemcitabine. IFNα2b stimulates autophagic flux and protects cells from gemcitabine‐induced cell death, contributing to chemoresistance. In contrast, IFNβ1a inhibits autophagosome formation and enhances gemcitabine‐induced cell death, resulting in ...
Lucy E. Bonilla +10 more
wiley +1 more source
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
FEBS Open Bio, EarlyView.During the current opioid crisis, the majority of overdose deaths are attributed to ultra‐potent synthetic opioids, such as fentanyl. While fentanyl exerts its action via opioid receptors, we propose that potassium channels in the brain blood vessels may also sense fentanyl.
Shiwani Thapa +4 more
wiley +1 more source
FEBS Open Bio, EarlyView.This minireview explores fluorination as a key strategy to optimize therapeutic molecules and nanocarriers. By incorporating different fluorinated motifs—from single atoms to linear and branched chains—drug delivery, cellular uptake, and colloidal stability can be improved and fine‐tuned.
Martina Beccalli +2 more
wiley +1 more source