Organic–inorganic hybrid co-polymer thin films were deposited on silicon(100) substrates under the several ratio of TEOS (tetraethoxysilane) against cyclohexene by plasma enhanced chemical vapour deposition (PECVD) method. Toluene and TEOS were utilized as organic and inorganic precursors each, and hydrogen and argon were also used as a bubbler and carrier gases, respectively. In order to compa...

This work presents a combined experimental-numerical framework for the biomechanical characterization of highly hydrated collagen hydrogels, namely with 0.20, 0.30 and 0.40% (by weight) of collagen concentration. Collagen is the most abundant protein in the extracellular matrix of animals and humans. Its intrinsic biocompatibility makes collagen a promising substrate for embedding cells within ...

dear editor,i read with interest article that published entitled *isolation and identification of bioactive compound producing rhodococcus spp. isolated from soil samples {ijmcm/5(1) (2015) 463-468}* [1]. some of the genus such as nocardia, gordonia, mycobacterium and rhodococcus are in actinomycete family and they are gram-positive and partially acid-fast. rhodococcus species usually stain gra...

Cyclic phosphoric acids displaying planar chiral paracyclophane structures, which include a 1,1'-ferrocenediyl unit, have been designed as a new class of chiral organocatalysts. Their synthesis, optical resolution, structural characterization and preliminary catalytic tests are reported.

An equitable coloring of a graph G is a proper coloring of the vertices of G such that color classes differ in size by at most one. In this note, we verify the equitable coloring conjecture [W. Meyer, Amer. Math. Monthly 80 (1973), 920–922] for some classes of graphs which are defined by forbidden induced subgraphs using known results.

A graph G on n vertices is pancyclic if G contains cycles of all lengths`for 3 ` n and G is cycle extendable if for every nonhamiltonian cycle C G there is a cycle C 0 G such that V (C) V (C 0) and jV (C 0) n V (C)j = 1. We prove that (i) every 2-connected K 1;3-free graph is pancyclic, if G is P 5-free and n 6, if G is P 6-free and n 10, or if G is P 7-free, deer-free and n 14, and (ii) every ...

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special cl...

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An antimatroid is an accessible union-closed family of subsets of a 0nite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antima...

Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph. Let Fk(H) be the set of k-connected H-free graphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow a finite exceptional set of graphs. But if the symmetric difference of Fk(H1) and Fk(H2) is finite and we allow ...