2 resultados para Gustavson, Björn: Concept-driven developement and the organization of the process of change

em Cochin University of Science


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Most of the procedures reported for the synthesis of metal nanoparticles involve the use of strong reducing agents or elevated temperatures. This limits the possibility of developing metal nanoparticle based sensors for the in situ detection of analytes. One of the objectives of the present investigations is to (i) develop newer methodologies for the synthesis of metal nanoparticles in aqueous medium at ambient conditions and (ii) their use in the detection of metal cations by taking advantage of the unique coordination ability. Ideally, biocompatible molecules which possess both the reducing and stabilizing groups are desirable for such applications. Formation of stable supramolecular assembly, by bringing metal nanoparticles close to each other, results in plasmon coupling and this strategy can be effectively utilized for the development of metal nanoparticle based sensors.Another objective of the present study is to understand the supramolecular organization of molecules on surfaces. Various noncovalent interactions between the molecules and with surface play a decisive role in their organizations. An in-depth understanding of these interactions is essential for device fabrications. Recent photophysical studies have revealed that phenyleneethynylene based molecular systems are ideal for device application. The second objective of the thesis focuses on understanding the (i) organization of phenyleneethynylenes on highly oriented pyrolytic graphite (HOPG) surface with atomic level precision and (ii) weak intermolecular interactions which drive their organization.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes