Results 41 to 50 of about 751,203 (314)
The Saturation Number for the Length of Degree Monotone Paths
Discussiones Mathematicae Graph Theory, 2015 A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G).
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Inducibility of directed paths [PDF]
, 2020 A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices.
Choi, Ilkyoo +2 more
core
Microstructure of compacted low-plasticity soils: the initial fabric and its evolution on stress and suction paths [PDF]
, 2023 Soils used in earthworks undergo different hydro-mechanical paths due to the compaction and construction process, the change in climatic conditions or the groundwater level oscillations.
Núria M. Pinyol +7 more
core +1 more source
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn
AxiomsThe crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete graphs,
Michal Staš +2 more
doaj +1 more source
Dementia Friendly Walking Project: Evaluation Report [PDF]
, 2017 The evaluation project explored the second year of the dementia friendly walking project. Paths for All were keen to obtain views of people living with dementia, their carers and other walk attendees regarding their experiences of attending dementia ...
Gibson, Grant +2 more
core
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
Secluded Path via Shortest Path [PDF]
, 2014 We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3,5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight ...
Matthew P. Johnson 0001 +2 more
openaire +2 more sources
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
The need for a Canadian Criminal Code offence of coercive control
Journal of Community Safety and Well-BeingCanada is currently considering legislating an offence of coercive control. Coercive controlling behaviour is currently criminalized in the UK, Scotland, Ireland, Northern Ireland and New South Wales, Australia.
Crystal J Giesbrecht
doaj +1 more source
Saturation Spectrum of Paths and Stars
Discussiones Mathematicae Graph Theory, 2017 A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number,
Faudree Jill +4 more
doaj +1 more source