molecular characterization of 19 jatropha accessions that included 15 accessions of j.curcas and 4 different species was carried out using 3 different markers systems. highest polymorphism (96.67%) was recorded by rapd followed by damd (91.02%) and issr (90%). polymorphism information content (pic) was higher for damd (0.873) and almost equal for rapd (0.863) and issr (0.862) markers, whereas r...

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.

Let k be a natural number. We introduce k-threshold graphs. We show that there exists anO(n) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2threshold graphs by forbidden induced subgraphs. We introduce restricted, and spe...

Additive manufacturing (AM) has the potential to create geometrically complex parts that require a high degree of customization, using less material and producing less waste. Recent studies have shown that AM can be an economically viable option for use by the industry, yet there are some inherent challenges associated with AM for wider acceptance. The lack of standards in AM impedes its use fo...