Results 41 to 50 of about 118,378,802 (306)
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
Annals of Combinatorics, 2008 Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: The number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained.
Jerebic, Janja +2 more
openaire +2 more sources
A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs
مجلة بغداد للعلوم, 2023 Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)
BIBIN K JOSE
doaj +1 more source
ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
Kyushu Journal of Mathematics, 1994 Let \(G\) be a graph. The distance \(i\)-graph of \(G\) is the graph \(G_ i\) defined on the vertex set of \(G\), and \(u\) and \(v\) are adjacent if and only if the distance between \(u\) and \(v\) is \(i\). This paper studies the distance \(i\)-graph of a distance regular graph and its connected component, and obtains a lot of special features of the
openaire +2 more sources
On the degree distance of a graph
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Dankelmann +3 more
openaire +2 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
Spectral distances on graphs [PDF]
Discrete Applied Mathematics, 2015 25 pages, 12 ...
Jiao Gu, Bobo Hua, Shiping Liu
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