Results 51 to 60 of about 305,530 (267)

Completely separable graphs

open access: yesDiscrete Applied Mathematics, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter L. Hammer, Frédéric Maffray
openaire   +2 more sources

Fitch Graph Completion

open access: yes, 2023
Horizontal gene transfer is an important contributor to evolution. According to Walter M.\ Fitch, two genes are xenologs if they are separated by at least one HGT. More formally, the directed Fitch graph has a set of genes is its vertices, and directed edges $(x,y)$ for all pairs of genes $x$ and $y$ for which $y$ has been horizontally transferred at ...
Marc Hellmuth   +2 more
openaire   +3 more sources

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

Packing Trees in Complete Bipartite Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H).
Wang Jieyan
doaj   +1 more source

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

The edge-regular complete maps

open access: yesOpen Mathematics, 2020
A map is called edge-regular if it is edge-transitive but not arc-transitive. In this paper, we show that a complete graph Kn{K}_{n} has an orientable edge-regular embedding if and only if n=pd>3n={p}^{d}\gt 3 with p an odd prime such that pd≡3{p}^{d ...
Yu Xue, Lou Ben Gong
doaj   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Homomorphisms of complete n-partite graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1986
It is shown that for every homomorphism ϕ of a graph G there exists a contraction θϕ on G¯, the complement of G, such that ϕ(G)¯=θϕ(G¯) if and only if G is a complete n-partite graph.
Robert D. Girse
doaj   +1 more source

Character degree graphs that are complete graphs [PDF]

open access: yesProceedings of the American Mathematical Society, 2006
Let \(G\) be a finite group and let \(\text{cd}(G)\) denote the different integers which occur as the degrees of the irreducible complex characters of \(G\). Let \(\Gamma(G)\) be the graph whose vertex set is \(\text{cd}(G)-\{1\}\). An edge joins two vertices represented by positive integers \(a\) and \(b\) if \(\gcd(a,b)>1\). The authors prove that if
M. Bianchi   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy