Results 91 to 100 of about 3,567,425 (361)
Counting Hamilton cycles in sparse random directed graphs
, 2018 Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\ge(\log n+\omega(1))/n$ then D(n,p) typically has a directed Hamilton
Alon book N. +7 more
core +1 more source
Advanced Healthcare Materials, EarlyView.PGXTEC) liquid technology is utilized to develop highly respirable yeast beta‐glucan (YBG) microparticles for the treatment of pulmonary fibrosis. Compared to conventionally processed spray‐dried YBG, PGXTEC‐YBG exhibits greatly improved aerodynamic properties, enhanced pro‐fibrotic macrophage uptake, and effective downregulation of pro‐fibrotic ...
Nate Dowdall +14 more
wiley +1 more source
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements ...
Borowiecki Mieczysław, Broere Izak
doaj +1 more source
Semi-perfect 1-Factorizations of the Hypercube
, 2018 A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle.
Behague, Natalie C.
core +1 more source
Transforming Cancer Diagnosis and Therapy Through Fluorescent Hydrogels: A Review
Advanced Healthcare Materials, EarlyView.This article reviews fluorescent hydrogel systems for cancer detection, monitoring, and therapy. Mimicking the tumor microenvironment, these hydrogels enable real‐time imaging and targeted drug delivery. The review discusses design strategies, labeling techniques, and applications, highlighting challenges and future opportunities in cancer diagnostics ...
Elahe Masaeli +2 more
wiley +1 more source
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
Dating the business cycle: Evidence from Mongolia
Central Bank Review, 2019 Business cycle is an important indicator for making policy and management decisions. This paper compares the business cycle estimates for Mongolia based on a graphical and parametric methods.
Davaajargal Luvsannyam +2 more
doaj +1 more source
Have Business Cycles Become More Synchronous After NAFTA?
American Business Review, 2021 Trade agreements do not necessitate business cycle comovement. Focusing on NAFTA, we investigate whether business cycles in Canada, Mexico, and the US have become more synchronous after the landmark trade agreement came into effect in 1994.
Puneet Vatsa
doaj +1 more source
Advanced Healthcare Materials, EarlyView.The pyrogallol‐conjugated carboxymethylcellulose (CMC‐PG) hydrogel is applicated as a filler for the treatment of presbylaryngis, a vocal fold atrophy. CMC‐PG provides a bulking effect to the vocal folds. CMC‐PG is readily injectable and tissue adhesive, enabling sustained release of growth factor over long period.
Jihoon Jeon +7 more
wiley +1 more source
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source