Results 81 to 90 of about 2,293,482 (304)
Hamilton College Library Home Notes [PDF]
, 2017 The Communal Societies Collection at Burke Library, Hamilton College, has recently acquired a large collection of materials from the Mazdaznan movement. This neo-Zoroastrian cult was founded by Otoman Zar-Adusht Ha’nish (born Otto Hanisch) at the end of ...
core
Advanced Science, EarlyView.Glaucoma, a major cause of blindness, involves retinal ganglion cell (RGC) degeneration. This study shows growth hormone‐releasing hormone receptor (GHRHR) deficiency preserves RGC survival and restores vision, unlike activation which only aids survival.
Yan Tong +24 more
wiley +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
Hamilton College Library Home Notes [PDF]
, 2016 Communal Societies Collections: New Acqisitions Special Collections at Hamilton College has acquired some early publications from the I AM Activity movement begun in the 1930s and founded by Guy Ballard (aka Godfre Ray King) as a theosophical religious
core
Advanced Science, EarlyView.A piezocatalytic strategy enables simultaneous wastewater purification and hydrogen generation by harnessing mechanical energy. Complementary piezo‐induced charges are selectively directed toward oxidation and reduction pathways, achieving efficient pollutant degradation and continuous H2 evolution.
Yiqing Wei +8 more
wiley +1 more source
Advanced Science, EarlyView.Atomic coordination editing functions as an on/off switch that toggles single‐atom catalysts between CO2 electroreduction and hydrogen evolution. ABSTRACT Precise atomic coordination editing of single‐atom catalysts (SACs) provides an effective strategy to tune their electronic structures and catalytic selectivity. Yet, achieving near‐unity selectivity
Yukun Zhao +11 more
wiley +1 more source
Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 We describe an algorithm which enumerates all Hamilton cycles of a given 3-regular $n$-vertex graph in time $O(1.276^{n})$, improving on Eppstein's previous bound. The resulting new upper bound of $O(1.276^{n})$ for the maximum number of Hamilton cycles in 3-regular $n$-vertex graphs gets close to the best known lower bound of $\Omega(1.259^{n})$.
openaire +2 more sources
Graph Invariants and Large Cycles: A Survey
International Journal of Mathematics and Mathematical Sciences, 2011 Graph invariants provide a powerful analytical tool for investigation of abstract substructures of graphs. This paper is devoted to large cycle substructures, namely, Hamilton, longest and dominating cycles and some generalized cycles including Hamilton ...
Zh. G. Nikoghosyan
doaj +1 more source
Physics‐Informed Neural Network‐Enabled Forward Prediction and Inverse Design of Ring Origami
Advanced Science, EarlyView.This work presents a KRT‐PINN framework that integrates Kirchhoff rod theory with physics‐informed neural networks for the forward prediction and inverse design of ring origami consisting of closed‐loop rods. The framework predicts stable states of segmented rings with prescribed natural‐curvature profiles and determines the natural‐curvature profiles ...
Luyuan Ning +3 more
wiley +1 more source
Hamilton cycles in digraphs of unitary matrices
Discrete Mathematics, 2006 A set $S\subseteq V$ is called an {\em $q^+$-set} ({\em $q^-$-set}, respectively) if $S$ has at least two vertices and, for every $u\in S$, there exists $v\in S, v\neq u$ such that $N^+(u)\cap N^+(v)\neq \emptyset$ ($N^-(u)\cap N^-(v)\neq \emptyset$, respectively). A digraph $D$ is called {\em s-quadrangular} if, for every $q^+$-set $S$, we have $|\cup
Gregory Z. Gutin +3 more
openaire +2 more sources