Results 41 to 50 of about 292,611 (264)

GCD-graphs and NEPS of complete graphs

open access: yesArs Mathematica Contemporanea, 2012
A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. Such graphs are known to have integral spectrum. A non-complete extended p-sum, or NEPS in short, is well-known general graph product. We show that the class of gcd-graphs and the class of NEPS of complete graphs coincide.
Klotz, Walter, Sander, Torsten
openaire   +3 more sources

Infection Control Practices for Vascular Access Management in Hemodialysis: Results From a Nationwide Survey of Japanese National University Hospitals

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada   +6 more
wiley   +1 more source

On multiplicity of quadrilaterals

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n.
S.S. Rukmani, V. Vijayalakshmi
doaj   +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

Organ‐specific redox imbalances in spinal muscular atrophy mice are partially rescued by SMN antisense oligonucleotides

open access: yesFEBS Letters, EarlyView.
We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +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

Graph Isomorphism Completeness for Trapezoid Graphs

open access: yesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015
4 pages, 3 Postscript ...
openaire   +3 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

The Coloring Graph of Complete Graphs

open access: yesThe PUMP Journal of Undergraduate Research, 2019
We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.
openaire   +2 more sources

Home - About - Disclaimer - Privacy