Results 71 to 80 of about 782,126 (230)
FEBS 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
On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
Open Mathematics, 2022 A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source
A Numerical Study on the Regularity of d-Primes via Informational Entropy and Visibility Algorithms
Complexity, 2020 Let a d-prime be a positive integer number with d divisors. From this definition, the usual prime numbers correspond to the particular case d=2. Here, the seemingly random sequence of gaps between consecutive d-primes is numerically investigated.
B. L. Mayer, L. H. A. Monteiro
doaj +1 more source
A construction of small regular bipartite graphs of girth 8 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq2 -- q) vertices.
Camino Balbuena
doaj +1 more source
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
Barekeng, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra +4 more
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
FEBS Letters, EarlyView.Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante +10 more
wiley +1 more source
Effective Conversion of Non-Prime Graphs to Prime Graphs
International Journal of Analysis and ApplicationsA graph G is considered to have a prime labeling when each of its n vertices is assigned a unique label from the set {1, 2, 3, 4, ..., n}, ensuring that the labels of any two connected vertices are coprime. In the literature, many graph classes identified as prime graphs and non-prime graphs.
Karnam Gurunadhan Tharunraj +1 more
openaire +1 more source