Results 31 to 40 of about 187,084,903 (250)
In this paper we introduce an intersection graph of a graph G, with vertex set the minimum edge-cuts of G. We find the minimum cut-set graphs of some well-known families of graphs and study the mincut graph as a graph operator.
Christo Kriel, Eunice Mphako-Banda
doaj +1 more source
On families of 2-nearly Platonic graphs
A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is called balanced if d1 = d2.
Dalibor Froncek +3 more
doaj +1 more source
The matrix Jacobson graph of finite commutative rings
The notion of the matrix Jacobson graph was introduced in 2019. Let R be a commutative ring and J(R) be the Jacobson radical of ring R. The matrix Jacobson graph of ring R size m × n, denoted 𝔍(R)m × n, is defined as a graph where the vertex set is Rm ...
Siti Humaira +3 more
doaj +1 more source
On star coloring of Mycielskians
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose ...
K. Kaliraj, V. Kowsalya, Vernold Vivin
doaj +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
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
Eternal domination and clique covering
We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
Design and analysis strategies for robust microbiome ageing research
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +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
On the rainbow connection numbers of line, middle, and total graphs of wheels
An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti +2 more
doaj +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source

