Results 51 to 60 of about 86,293 (266)
A Graph Theory of Rook Placements [PDF]
The Electronic Journal of Combinatorics, 2021 Two boards are rook equivalent if they have the same number of non-attacking rook placements for any number of rooks. Define a rook equivalence graph on an equivalence class of Ferrers boards by specifying that two boards are connected by an edge if you can obtain one of the boards by moving squares in the other board out of one column and into a ...
openaire +2 more sources
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
On a Connection of Number Theory with Graph Theory [PDF]
Czechoslovak Mathematical Journal, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Somer, Lawrence, Křížek, Michal
openaire +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
Discrete Mathematics, 1976 AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(G) of a simple graph G of order n is the graph obtained from G by recursively joining pairs of nonadjacent vertices with degree-sum at least k. It is shown that, for many properties P, one can find a suitable value of k (depending on P and n) such that ...
J. Adrian Bondy, Vasek Chvátal
openaire +2 more sources
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
New Approach for Closure Spaces on Graphs Based on Relations and Graph Ideals
AxiomsThe main aim of this paper is to combine the connections between graph theory and rough set theory. We created graph ideal ASs by proposing the interior and closure operators, utilizing the concept of graph ideals.
Rehab Alharbi +3 more
doaj +1 more source
MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs [PDF]
Neutrosophic Sets and SystemsGraph theory examines networks consisting of nodes (vertices) and the connections (edges) between them. Mixed graphs, which combine both undirected and directed edges, provide a versatile framework for representing relationships with symmetric and ...
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
SAMPLING THEORY FOR GRAPH SIGNALS ON PRODUCT GRAPHS [PDF]
2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018 Accepted to GlobalSIP ...
Rohan Varma, Jelena Kovacevic
openaire +2 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.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