Results 41 to 50 of about 278,151 (262)
Mixed metric dimension of graphs [PDF]
arXiv admin note: text overlap with arXiv:1602 ...
Aleksander Kelenc +3 more
openaire +3 more sources
On the Mixed Minus Domination in Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Baogen, Kong, Xiangyang
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitre Costa Dourado +4 more
openaire +2 more sources
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
Mixing colourings in 2K2-free graphs
4 pages, 2 ...
Carl Feghali, Owen D. Merkel
openaire +2 more sources
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 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
On the mixed domination problem in graphs
A mixed dominating set of a simple graph G=(V,E) is a subset [email protected][email protected]?E such that every vertex or edge not in D is adjacent or incident to at least one vertex or edge in D. The mixed domination problem is to determine a minimum mixed dominating set of G.
James K. Lan, Gerard Jennhwa Chang
openaire +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
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
Multi-Scale Mixed Dense Graph Convolution Network for Skeleton-Based Action Recognition
In skeleton-based action recognition, the approaches based on graph convolutional networks(GCN) have achieved remarkable performance by modeling spatial-temporal graphs to explore the physical dependencies between body joints.
Hailun Xia, Xinkai Gao
doaj +1 more source

