Ordered mesoporous silicas SBA-15 with high loadings of pendant vinyl groups have been synthesized via co-condensation of tetraethoxysilane (TEOS) and triethoxyvinylsilane (TEVS) templated with a triblock copolymer.

In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.

Polystyrene (PS) with pendant gold nanoparticles and PS-coated Fe(3)O(4) nanoparticles self-assemble into vesicle structures with PS and PS-coated Fe(3)O(4) nanoparticles in the wall and gold nanoparticles in the shell.

In this paper, we study the signless Laplacian spectral radius of unicyclic graphs with prescribed number of pendant vertices or independence number. We also characterize the extremal graphs completely.

In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50

Pendant oligoethyleneglycol groups confer water solubility to a cavitand over a wide pH range. The kinetic stability of the host-guest complexes reveals an effective stabilization through hydrogen bonding even in the highly competitive aqueous environment.

A unique octanuclear copper(II) cluster with a saddle-shaped structural topology has been prepared from a large, flexible polydentate ligand comprising a 4,4'-bipyridine linker bearing four pendant pyrazolate heterocycles.

In the title compound, C(21)H(16)N(2)O, the dihedral angle between the pendant aromatic rings is 74.2-(1)°.. The conformation is stabilized by an intramolecular O-H⋯N hydrogen bond.

Symphysodontella madhusoodananii Manju & Rajesh, sp. nov. an epiphytic pendant moss, with flagellate branches and long acuminate leaves with two short costa is described and illustrated from the tropical wet evergreen forests of the Western Ghats of India.

A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.