Green chemistry is an alternative route of which has overcome the limitations of other chemical methods. Nanocrystalline zinc oxide (NC-ZnO) with different structures have been grown on quartz plates by spin coating method by the use of plant extracts of Citrus aurantifolia which can be a cost effective and eco-friendly approach.. The present exploration describes the synthesis and characteriza...

In the present work, we report the synthesis of binary nano metal oxides such as Zinc /Copper Oxide via novel dry synthetic methods such as thermal decomposition of oxalate precursor. The synthesis route involves facile solid-phase mechanochemical activation of a physical mixture of simple copper/zinc salts and oxalic acid, followed by calcination of the as-ground oxalate precursors at 450◦C. X...

BACKGROUND Conventional gold standard characterization of chigger mites involves chemical preparation procedures (i.e. specimen clearing) for visualization of morphological features, which however contributes to destruction of the arthropod host DNA and any endosymbiont or pathogen DNA harbored within the specimen. METHODOLOGY/PRINCIPAL FINDINGS In this study, a novel work flow based on autof...

The occurrence of Fusarium spp associated with pecan tree (Carya illinoinensis) diseases in Brazil has been observed in recent laboratory analyses in Rio Grande do Sul State. Thus, in this study, we i) obtained Fusarium isolates from plants with disease symptoms; ii) tested the pathogenicity of these Fusarium isolates to pecan; iii) characterized and grouped Fusarium isolates that were pathogen...

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.