Results 41 to 50 of about 208,068 (260)
On Mixed Metric Dimension of Rotationally Symmetric Graphs
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitre Costa Dourado +4 more
openaire +2 more sources
A Concise Study of Some Superhypergraph classes [PDF]
In graph theory, the hypergraph extends the traditional graph structure by allowing edges to connect multiple vertices, and this concept is further broadened by the superhypergraph.
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
Generalized Spectral Characterization of Mixed Graphs [PDF]
The spectral characterization of graphs is an important topic in spectral graph theory, which has been studied extensively in recent years. Unlike the undirected case, however, the spectral characterization of mixed graphs (digraphs) has received much less attention so far, which will be the main focus of this paper.
Wei Wang 0195 +3 more
openaire +3 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
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
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
Mixing colourings in 2K2-free graphs
4 pages, 2 ...
Carl Feghali, Owen D. Merkel
openaire +2 more sources
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
m-step inverse fuzzy mixed competition graphs
The notion of competition graphs has a wide range of applications and has been utilized in designing various ecological problems and real-world competitions.
Rahul Mondal, Ganesh Ghorai
doaj +1 more source

