Results 91 to 100 of about 446,387 (282)
The Hamilton-Waterloo Problem with even cycle lengths
, 2019 The Hamilton-Waterloo Problem HWP$(v;m,n;\alpha,\beta)$ asks for a 2-factorization of the complete graph $K_v$ or $K_v-I$, the complete graph with the edges of a 1-factor removed, into $\alpha$ $C_m$-factors and $\beta$ $C_n$-factors, where $3 \leq m < n$
Burgess, A. C. +2 more
core +1 more source
Advanced Materials Technologies, EarlyView.Flexible Chitosan‐glycerol sensor integrated with porous laser‐induced graphene (LIG) electrodes enable room‐temperature chemiresistive detection of ammonia (NH3) and proof‐of‐concept detection of fish spoilage. ABSTRACT We report a metal‐free sensor platform combining laser induced graphene (LIG) electrodes with drop‐deposited, glycerol‐plasticized ...
Mintesinot Tamiru Mengistu +9 more
wiley +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
Advanced Materials Technologies, EarlyView.We introduce an additively manufactured bioreactor with a perfusion flow system and integrated temperature and pH sensors for skeletal muscle tissue biofabrication. The bioreactor's performance was evaluated by assessing the viability, spreading of the myoblast cells in a printed scaffold, and contraction of the isolated murine musculi interossei ...
Lys Sprenger +9 more
wiley +1 more source
A Formula for the Energy of Circulant Graphs with Two Generators
Journal of Applied Mathematics, 2016 We derive closed formulas for the energy of circulant graphs generated by 1 and γ, where γ⩾2 is an integer. We also find a formula for the energy of the complete graph without a Hamilton cycle.
Justine Louis
doaj +1 more source
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Daniela Kühn +2 more
openaire +2 more sources
Pre‐Encoded IFN‐I Sensitivity Exacerbates Memory T Cell Senescence in Solid Tumors
Advanced Science, EarlyView.Type I interferon (IFN‐I) signaling promotes p21‐dependent cell cycle arrest in senescent tumor‐specific memory T cells, resulting in poor proliferative responses and solid tumor regression during cancer vaccination. Conversely, IFNα/β receptor blockade reinvigorates T cell proliferation to regress solid tumors and is more effective with increasing ...
Andrew Nguyen +4 more
wiley +1 more source
Two Sufficient Conditions for Hamilton and Dominating Cycles
International Journal of Mathematics and Mathematical Sciences, 2012 We prove that if is a 2-connect graph of size (the number of edges) and minimum degree with , where when and when , then each longest cycle in is a dominating cycle.
Zh. G. Nikoghosyan
doaj +1 more source
Hamiltonicity of 3tEC Graphs with α=κ+1
Journal of Mathematics, 2021 A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γtG of G.
Huanying He, Xinhui An, Zongjun Zhao
doaj +1 more source
Hamilton Cycles and Degree Sequences
Electronic Notes in Discrete Mathematics, 2000 Abstract The connection between the degree-sequence and the hamiltonicity of a graph is a classic and much investigated problem of graph-theory. The weaker and weaker sufficient degree conditions for hamiltonicity of Dirac, Posa, Bondy and Chvatal often belong to the curriculum of introductory graph-theory courses.
openaire +1 more source