Tuning the Efficiency of Dendritic Nanocarriers using Conformational Constraints

A series of deoxycholic and cholic acid-derived oligomers were synthesized and their ability to extract hydrophilic dye molecules of different structure, size, and functional groups into nonpolar media was studied. The structure of the dye and dendritic effect in the extraction process was examined using absorption spectroscopy and dynamic light scattering (DLS). The efficiency of structurally preorganized oligomers in the aggregation process was evaluated by 1-anilinonaphthalene-8-sulfonic acid (ANS) fluorescence studies. The possible formation of globular structures for higher-generation molecules was investigated by molecular modeling studies and the results were correlated with the anomaly observed in the extraction process with this molecule. The ability of these molecules for selective extraction of specific dyes from blended colors is also reported.

Rainbow Connection Number and Connectivity

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Quantum corrections to screening at strong coupling

We compute a certain class of corrections to (specific) screening lengths in strongly coupled non-abelian plasmas using the AdS/CFT correspondence. In this holographic framework, these corrections arise from various higher curvature interactions modifying the leading Einstein gravity action. The changes in the screening lengths are perturbative in inverse powers of the `t Hooft coupling or of the number of colors, as can be made precise in the context where the dual gauge theory is superconformal. We also compare the results of these holographic calculations to lattice results for the analogous screening lengths in QCD. In particular, we apply these results within the program of making quantitative comparisons between the strongly coupled quark-gluon plasma and holographic descriptions of conformal field theory. (c) 2012 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Triangle-Free Planar Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G) ? ? + 2, where ? = ?(G) denotes the maximum degree of the graph. If every induced subgraph H of G satisfies the condition |E(H)| ? 2|V(H)|-1, we say that the graph G satisfies Property A. In this article, we prove that if G satisfies Property A, then a'(G) ? ? + 3. Triangle-free planar graphs satisfy Property A. We infer that a'(G) ? ? + 3, if G is a triangle-free planar graph. Another class of graph which satisfies Property A is 2-fold graphs (union of two forests). (C) 2011 Wiley Periodicals, Inc. J Graph Theory

Unusual Salt-Induced Color Modulation through Aggregation-Induced Emission Switching of a Bis-cationic Phenylenedivinylene-Based pi Hydrogelator

The synthesis, hydrogelation, and aggregation-induced emission switching of the phenylenedivinylene bis-N-octyl pyridinium salt is described. Hydrogelation occurs as a consequence of pi-stacking, van der Waals, and electrostatic interactions that lead to a high gel melting temperature and significant mechanical properties at a very low weight percentage of the gelator. A morphology transition from fiber-to-coil-to-tube was observed depending on the concentration of the gelator. Variation in the added salt type, salt concentrations, or temperature profoundly influenced the order of aggregation of the gelator molecules in aqueous solution. Formation of a novel chromophore assembly in this way leads to an aggregation-induced switch of the emission colors. The emission color switches from sky blue to white to orange depending upon the extent of aggregation through mere addition of external inorganic salts. Remarkably, the salt effect on the assembly of such cationic phenylenedivinylenes in water follow the behavior predicted from the well-known Hofmeister effects. Mechanistic insights for these aggregation processes were obtained through the counterion exchange studies. The aggregation-induced emission switching that leads to a room-temperature white-light emission from a single chromophore in a single solvent (water) is highly promising for optoelectronic applications.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.

Multi-script and multi-oriented text localization from scene images

This paper describes a new method of color text localization from generic scene images containing text of different scripts and with arbitrary orientations. A representative set of colors is first identified using the edge information to initiate an unsupervised clustering algorithm. Text components are identified from each color layer using a combination of a support vector machine and a neural network classifier trained on a set of low-level features derived from the geometric, boundary, stroke and gradient information. Experiments on camera-captured images that contain variable fonts, size, color, irregular layout, non-uniform illumination and multiple scripts illustrate the robustness of the method. The proposed method yields precision and recall of 0.8 and 0.86 respectively on a database of 100 images. The method is also compared with others in the literature using the ICDAR 2003 robust reading competition dataset.

Exploring the color of transition metal ions in irregular coordination geometries: new colored inorganic oxides based on the spiroffite structure, Zn2-xMxTe3O8 (M = Co, Ni, Cu)

We describe the synthesis, crystal structures, and optical absorption spectra of transition metal substituted spiroffite derivatives, Zn2-xMxTe3O8 (M-II = Co, Ni, Cu; 0 < x <= 1.0). The oxides are readily synthesized by solid state reaction of stoichiometric mixtures of the constituent binaries at 620 degrees C. Reitveld refinement of the crystal structures from powder X-ray diffraction (XRD) data shows that the Zn/MO6 octahedra are strongly distorted, as in the parent Zn2Te3O8 structure, consisting of five relatively short Zn/M-II-O bonds (1.898-2.236 angstrom) and one longer Zn/M-II-O bond (2.356-2.519 angstrom). We have interpreted the unique colors and the optical absorption/diffuse reflectance spectra of Zn2-xMxTe3O8 in the visible, in terms of the observed/irregular coordination geometry of the Zn/M-II-O chromophores. We could not however prepare the fully substituted M2Te3O8 (M-II = Co, Ni, Cu) by the direct solid state reaction method. Density Functional Theory (DFT) modeling of the electronic structure of both the parent and the transition metal substituted derivatives provides new insights into the bonding and the role of transition metals toward the origin of color in these materials. We believe that transition metal substituted spiroffites Zn2-xMxTe3O8 reported here suggest new directions for the development of colored inorganic materials/pigments featuring irregular/distorted oxygen coordination polyhedra around transition metal ions.

Algebraic characterization of rainbow connectivity

The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.

Rainbow Emission from an Atomic Transition in Doped Quantum Dots

Although semiconductor quantum dots are promising materials for displays and lighting due to their tunable emissions, these materials also suffer from the serious disadvantage of self-absorption of emitted light. The reabsorption of emitted light is a serious loss mechanism in practical situations because most phosphors exhibit subunity quantum yields. Manganese-based phosphors that also exhibit high stability and quantum efficiency do not suffer from this problem but in turn lack emission tunability, seriously affecting their practical utility. Here, we present a class of manganese-doped quantum dot materials, where strain is used to tune the wavelength of the dopant emission, extending the otherwise limited emission tunability over the yellow-orange range for manganese ions to almost the entire visible spectrum covering all colors from blue to red. These new materials thus combine the advantages of both quantum dots and conventional doped phosphors, thereby opening new possibilities for a wide range of applications in the future.

Fine-tuning solid-state luminescence in NPIs (1,8-naphthalimides): impact of the molecular environment and cumulative interactions

An investigation of a series of seven angular ``V'' shaped NPIs (1-7) is presented. The effect of substitution of these structurally similar NPIs on their photophysical properties in the solution-state and the solid-state is presented and discussed in light of experimental and computational findings. Compounds 1-7 show negligible to intensely strong emission yields in their solid-state depending on the nature of substituents appended to the oxoaryl moiety. The solution and solid-state properties of the compounds can be directly correlated with their structural rigidity, nature of substituents and intermolecular interactions. The versatile solid-state structures of the NPI siblings are deeply affected by the pendant substituents. All of the NPIs (1-7) show antiparallel dimeric pi-pi stacking interactions in their solid-state which can further extend in a parallel, alternate, orthogonal or lateral fashion depending on the steric and electronic nature of the C-4' substituents. Structural investigations including Hirshfeld surface analysis methods reveal that where strongly interacting systems show weak to moderate emission in their condensed states, weakly interacting systems show strong emission yields under the same conditions. The nature of packing and extended structures also affects the emission colors of the NPIs in their solid-states. Furthermore, DFT computational studies were utilized to understand the molecular and cumulative electronic behaviors of the NPIs. The comprehensive studies provide insight into the condensed-state luminescence of aggregationprone small molecules like NPIs and help to correlate the structure-property relationships.

UNO Gets Easier for a Single Player

This work is a follow up to 2, FUN 2010], which initiated a detailed analysis of the popular game of UNO (R). We consider the solitaire version of the game, which was shown to be NP-complete. In 2], the authors also demonstrate a (O)(n)(c(2)) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is polynomial time when the number of colors is a constant. In this work, we propose a kernelization algorithm, a consequence of which is that the problem is fixed-parameter tractable when the number of colors is treated as a parameter. This removes the exponential dependence on c and answers the question stated in 2] in the affirmative. We also introduce a natural and possibly more challenging version of UNO that we call ``All Or None UNO''. For this variant, we prove that even the single-player version is NP-complete, and we show a single-exponential FPT algorithm, along with a cubic kernel.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.