We introduce and study a class of simplicial complexes, the orphan complexes, associated to simple graphs whose family of (open or closed) vertex-neighborhoods are anti-Sperner. Under suitable restrictions, we show that orphan complexes of such graphs are always shellable and provide a characterization of graphs in terms of induced forbidden subgraphs contained in this restricted subfamily.

In this paper we demonstrate that several theorems from [1] and [3] do not hold as they are stated. These are the theorems regarding forbidden subposet characterizations of certain classes of coverincomparability graphs. In this paper we correct a mistake in the main theorem of [1], reformulate the corresponding statements and present corrected proofs. We further characterize posets whose cover...

Extracellular vesicles (ECVs) are nano-sized vesicles released by all cells in vitro as well as in vivo. Their role has been implicated mainly in cell-cell communication, but also in disease biomarkers and more recently in gene delivery. They represent a snapshot of the cell status at the moment of release and carry bioreactive macromolecules such as nucleic acids, proteins, and lipids. A major...

nowadays various methods are presented for synthesis of barium strontium titanate (bst) nanopowders with different morphology and properties. each of these (bst)s has got individual characterization that makes it suitable for a special application. every method has a special quality, causes it to have preference over the other methods. low processing temperature is a desired point which most of...

In this paper, a brief summary of different methods of fabrication of optical preform and fiber is reviewed. Several methods of incorporation of erbium ions into optical preforms are studied. Characterization of the fabricated erbium doped fibers including measurements of refractive index profile, absorption, fluorescence and gain spectra and metastable lifetime are described. It is also expres...

In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.

For the family of graphs with xed-size vertex cover k, we present all of the forbidden minors (obstructions), for k up to ve. We derive some results, including a practical nite-state recognition algorithm, needed to compute these obstructions.

A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. The list of minimal forbidden induced subgraphs for the c...