Results 71 to 80 of about 709,702 (295)
Pair L(2, 1)-Labelings of Infinite Graphs
An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +1 more source
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta +3 more
wiley +1 more source
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs [PDF]
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems.
Rayna Dimitrova, Rupak Majumdar
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
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
Constructing Infinite One-regular Graphs [PDF]
A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given.
Malnič, Aleksander +2 more
core +1 more source
Unordered Love in infinite directed graphs
A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +1 more source
On the distance spectrum of certain distance biregular graphs
In this article we present an infinite family of bipartite distance biregular graphs having an arbitrarily large diameter and whose distance matrices have exactly four distinct eigenvalues. This result answers a question posed by F.
Miriam Abdon +2 more
doaj +1 more source
On Graphs with Ramsey-Infinite Blocks
We write \(F\to (G,H)\) if when the edges of the graph F are colored red and blue either the red subgraph contains a copy of the graph G or the blue subgraph contains a copy of H. Then F is (G,H)-minimal if \(F\to (G,H)\) but for every subgraph F' of F we have \(F'\nrightarrow (G,H)\).
Stefan A. Burr +2 more
openaire +3 more sources
Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source

