Results 71 to 80 of about 101,128 (285)
Diameter of Zero Divisor Graphs of Finite Direct Product of Lattices [PDF]
, 2014 In this paper, we verify the diameter of zero divisor graphs with respect to direct ...
V. V. Joshi +2 more
core +1 more source
Domination and upper domination of direct product graphs [PDF]
Discrete Mathematics, 2018 16 pages, 1 ...
Colin Defant, Sumun Iyer
openaire +2 more sources
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Proof of a conjecture concerning the direct product of bipartite graphs [PDF]
, 2009 We prove that if the direct product of two connected bipartite graphs has isomorphic components, then one of the factors admits an automorphism that interchanges its partite sets. This proves a conjecture made by Jha, Klavžar and Zmazek in 1997 [P.
Hammack, Richard H.
core +1 more source
Super connectivity of direct product of graphs
Ars Mathematica Contemporanea, 2015 For a graph G , κ ( G ) denotes its connectivity. A graph G is super connected , or simply super- κ , if every minimum separating set is the neighborhood of a vertex of G , that is, every minimum separating set isolates a vertex.
openaire +3 more sources
FEBS 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
Distance Antimagic Product Graphs [PDF]
, 2022 A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for two distinct vertices x and y, ω(x)≠ω(y), where ω(x)=∑y∈N(x)f(y), for N(x) the open neighborhood of x.
Rinovia Simanjuntak, Aholiab Tritama
core +1 more source
Graf Konjugasi dari Hasil Kali Langsung Grup Alternating A4 dan Grup Simetri S3
Jambura Journal of MathematicsThis study investigates the structure of conjugacy graphs formed from the conjugacy classes in the alternating group A4, the symmetric group S3, and their direct product A4 × S3.
Muhammad Fikri Muammar +2 more
doaj +1 more source
Efficient Open Domination in Digraph Products
Mathematics, 2020 A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) .
Dragana Božović, Iztok Peterin
doaj +1 more source
FEBS Letters, EarlyView.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