staphylococcus aureus carrying pvl gene remain major health problem associated with highly virulent infections. characterization of such gene is important to know the impact and the functional significance of nucleotide variations. pcr and standard sequencing were performed for twelve sudanese strains from different sources. protein structures prediction, modeling and physiochemical analysis we...

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.

nanotechnology is the study of manipulating matter on an atomic and molecular scale. generally, nanotechnology deals with developing materials, devices, or other structures possessing at least one dimension size from 1 to 100 nanometers .  carbon nanotubes have great potentials for novel applications in industry, drug delivery system and many other uses. in this work after purification, multiwa...

In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...

Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.

Ethanol is renewable and safe fuel and it is mainly produced based on microbial fermentation. The present study aims to isolate and identify ethanol producing Zymomonas spp. from natural environments with characterization, optimization and evaluation of their ethanol productivity. Samples were screened for ethanol producing bacteria on RM medium. Ethanol producing isolates were selected for cha...