Let G = (X; Y; E(G)) be a bipartite graph with vertex set V (G) = X ∪ Y and edge set E(G) and let g and f be two non-negative integer-valued functions de1ned on V (G) such that g(x)6f(x) for each x∈V (G). A (g; f)-factor of G is a spanning subgraph F of G such that g(x)6dF (x)6f(x) for each x∈V (F); a (g; f)-factorization of G is a partition of E(G) into edge-disjoint (g; f)-factors. In this pa...

Let G be a 4-connected graph. For an edge e of G, we do the following operations on G: first, delete the edge e from G, resulting the graph G e; second, for all vertices x of degree 3 in G e, delete x from G e and then completely connect the 3 neighbors of x by a triangle. If multiple edges occur, we use single edges to replace them. The final resultant graph is denoted by G e. If G e is 4-conn...

Energy gaps, AXsar (X=E, H and G) (AX.,.,-=lia,„,,,InrX“dpka,) between single (s) and triplet (I) states werecalculated at B3LTP/6-3 I 1.HO" level of theory. Our results showed that electron donating substituents(G = -NHz, -OH. -CH), -F, -Cl and -Br) at phenyl group cause to increase and electron withdrawingsubstiluents (G -CF2. and -NO:) lead to decrease the singlet-triplet energy gaps of Ar -...

Present study was undertaken to estimate the magnitude of genotype × environment interaction (GEI) and identify stability improved high-yielding varieties Indian mustard (Brassica juncea L. Czerns & coss.). The 57 genotypes were evaluated in RBD along with three replications during Rabi crop seasons environments. Analysis variance on 14 traits carried out individually as well pooled over Yi...

Let G be a split connected reductive algebraic group. E ? B $\mathcal {E}\longrightarrow \mathcal {B}$ × $G\times G$ -torsor over smooth base scheme and X regular compactification of G. We describe the Grothendieck ring associated fibre bundle ( ) : = {E}(X):=\mathcal {E}\times _{G\times G} X$ , as an algebra canonical toric flag . These are relative versions corresponding results on in case wh...

The transformation graph G−++ of G is the graph with vertex set V (G) ∪ E(G) in which the vertex x and y are joined by an edge if one of the following conditions holds: (i) x, y ∈ V (G), and x and y are not adjacent in G, (ii) x, y ∈ E(G), and x and y are adjacent in G, (iii) one of x and y is in V (G) and the other is in E(G), and they are incident in G. In this paper, it is shown that for two...

background: this study was designed to evaluate whether or not t. gondii and its derivatives can change the gene expression level of il-10 in murine leukocytes in vivo.   methods: fifty balb/c mice were divided into 5 groups, four of which received the excretory/secretory product (esp) from cell culture medium, the esp from cell free medium, the toxoplasma lysate product (tlp) and the active ta...

For a simple graph G = (V,E) with the vertex set V and the edge set E , a vertex irregular total k -labeling f : V ∪E → {1, 2, . . . , k} is a labeling ∗ Also at Department of Mathematics, Faculty of Mathematics and Sciences, University of Gadjah Mada, Yogyakarta, Indonesia. D. INDRIATI ET AL. /AUSTRALAS. J. COMBIN. 65 (1) (2016), 14–26 15 of vertices and edges of G in such a way that for any t...