نتایج جستجو برای: merrifield
تعداد نتایج: 202 فیلتر نتایج به سال:
Cobalt complexes supported on silica and Merrifield resin are effective mediators for the controlled radical polymerization of vinyl acetate.
Four polymer-supported benzotriazoles were prepared by linkage of 5-(hydroxymethyl)benzotriazole and benzotrizaole-5-carboxylic acid with Wang resin, Merrifield resin, and (monomethoxy)poly(ethylene glycol). The solid-phase and liquid-phase syntheses of tetrahydroquinolines were achieved by two-pair coupling reactions of aldehydes and aromatic amines using these polymer-supported benzotriazoles...
let $g=(v,e)$ be a simple graph of order $n$ and size $m$. an $r$-matching of $g$ is a set of $r$ edges of $g$ which no two of them have common vertex. the hosoya index $z(g)$ of a graph $g$ is defined as the total number of its matchings. an independent set of $g$ is a set of vertices where no two vertices are adjacent. the merrifield-simmons index of $g$ is defined as the tota...
Boc-protected l-fulleropyrrolidino-glutamic acid was readily prepared and employed for the synthesis of fullerene-containing peptides using the solid-phase Boc chemistry developed by Merrifield.
Library Generation Analysis and Combinatorial Chemistry: dedicated to Bruce Merrifield 1 Bruce Merrifield Dynamic Combinatorial Assembly of Peptide-Rhenium Coordinates: Application to the Selection of hCyp-18 inhibitors from a Library of 12 × 16 Components 3 Dynamic Combinatorial Assembly of Peptide-Rhenium Coordinates: Coordination Chemistry for Generating New Analogs of hCyp-18 Ligands 5 Oxor...
This personal reflection on the author's experience as Bruce Merrifield's first graduate student has been adapted from a talk given at the Merrifield Memorial Symposium at the Rockefeller University on November 13, 2006.
The Merrifield-Simmons index i G of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, that is, the number of independent vertex sets of G The Hosoya index z G of a graph G is defined as the total number of independent edge subsets, that is, the total number of its matchings. By C n, k, λ we denote the set of graphs with n vertices, k cyc...
Abstract Many chemical indices have been invented in theoretical chemistry, such as Wiener index, Merrifield-Simmons index, Hosoya index, spectral radius and Randić index, etc. The extremal trees and unicyclic graphs for these chemical indices are interested in existing literature. Let G be a molecular graph (called a cacti), which all of blocks of G are either edges or cycles. Denote G (n, r) ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید