Results 41 to 50 of about 251,114 (266)
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
A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs [PDF]
Control and Optimization in Applied MathematicsGraph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring.
Hanifa Mosawi +2 more
doaj +1 more source
Fractional Local Metric Dimension of Comb Product Graphs
مجلة بغداد للعلوم, 2020 The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by .
Siti Aisyah +2 more
doaj +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
Discrete Dynamics in Nature and Society, 2021 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +1 more source
Graphs and CombinatoricsAbstract In 1971, Graham and Pollak provided a formula for the determinant of the distance matrix of any tree on n vertices. Yan and Yeh reproved this by exploiting the fact that pendant vertices can be deleted from trees without changing the remaining entries of the distance matrix.
Joshua N. Cooper, Gabrielle Tauscheck
openaire +2 more sources
On the distance spectra of graphs
Linear Algebra and its Applications, 2016 20 pages, 3 figures v2.
Aalipour, Ghodratollah +10 more
openaire +4 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
Reciprocal degree distance of some graph operations [PDF]
Transactions on Combinatorics, 2013 The reciprocal degree distance (RDD), defined for a connected graph G as vertex-degreeweighted sum of the reciprocal distances, that is, RDD(G) = u,v∈PV(G) dG(u)+dG(v) dG(u,v) . The reciprocal degree distance is a weight version of the Harary index, just
Kannan Pattabiraman, M. Vijayaragavan
doaj
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source