Transformation of Imine Cages into Hydrocarbon Cages
نویسندگان
چکیده
منابع مشابه
Generalized Cages
Let 2 6 k1 < k2 < · · · < kt, 3 6 g1 < g2 < · · · < gs < N be integer parameters. A (k1, k2, . . . , kt; g1, g2, . . . , gs;N)-graph is a graph that contains vertices of degrees k1, k2, . . . , kt but no other degrees and cycles of lengths g1, g2, . . . , gs but no other cycles of length < N . For any given set of parameters satisfying the above conditions, we present an explicit construction o...
متن کاملConnectivity of cages
A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer ν such there exists a (k; g)-graph with ν vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. In this paper we prove that the cages are monotonic in that f(k; g1) < f(k; g2) for all k ≥ 3 and 3 ≤ g1 < g2. We use this to prove that (k; g)-cages are 2-connected, and if k = 3 then their connectivity ...
متن کاملMolecular switches and cages
Chemists have developed a large number of synthetic switches, complementing the many types found in nature. Given their prominence in biology, it is not surprisingly that photoswitches, which are actuated by ultraviolet, visible or infrared light, have been an especially productive field of study. Despite their long history, new types of synthetic photoswitches continue to emerge and “old frien...
متن کاملThinking outside our cages.
Researchers seem to be stuck reiterating the now-familiar argument that barren boxes are bad for welfare and that rodents are due ethical consideration. But the prerequisites for real progress are new kinds of arguments, new types of data, and removal of very real practical and cultural obstacles to implementation of meaningful enrichment. We must discover what we have to do to effectively chan...
متن کاملConstructions of bi-regular cages
Given three positive integers r,m and g, one interesting question is the following: What is the minimum number of vertices that a graph with prescribed degree set {r,m}, 2 ≤ r < m, and girth g can have? Such a graph is called a bi-regular cage or an ({r,m}; g)-cage, and its minimum order is denoted by n({r,m}; g). In this paper we provide new upper bounds on n({r,m}; g) for some related values ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Angewandte Chemie
سال: 2019
ISSN: 0044-8249,1521-3757
DOI: 10.1002/ange.201814243