Results 51 to 60 of about 177,806 (308)
Steiner Wiener index of graph products [PDF]
Transactions on Combinatorics, 2016 The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj
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
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 Some Distance Spectral Characteristics of Trees
AxiomsGraham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat +2 more
doaj +1 more source
Metrics for Single-Edged Graphs over a Fixed Set of Vertices
Mathematical and Computational Applications, 2018 Graphs have powerful representations of all kinds of theoretical or experimental mathematical objects. A technique to measure the distance between graphs has become an important issue.
Ray-Ming Chen
doaj +1 more source
Variation of sum of two largest eigenvalues of the distance matrices of four-leaf graph
Journal of Hebei University of Science and Technology, 2020 In order to accurately obtain the extremum of the distance eigenvalues of fowr-leaf graphs under tow graph transformations in any case, two graph transformations of four-leaf graphs and the results of the above problems were given by using the properties
Zhe LYU, Yubin GAO
doaj +1 more source
Information Sciences, 2018 Ministerio de Ciencia e Innovación ECO2013-17766 ...
José Manuel, Gallardo +2 more
openaire +3 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
Bounds for some distance-based and degree-distance-based topological indices [PDF]
Contributions to Mathematics, 2022 Gul Ozkan Kızılırmak
doaj +1 more source