background: logistic discriminant method was applied to differentiate malignant from benign in a group of patients with proved breast lesions on the basis of ultrasonic parameters. materials and methods: our database include 273 patients' ultrasonographic pictures consisting of 14 quantitative variables. the measured variables were ultrasound propagation velocity, acoustic impedence and at...

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, 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...

In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K4).

The G-width of a class of graphs G is defined as follows. A graph G has G-width k if there are k independent sets N1, . . . ,Nk in G such that G can be embedded into a graph H ∈ G such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-para...

Given a class of graphs F , a forbidden subgraph characterization (FSC) is a set of graphs H such that a graph G belongs to F if and only if no graph of H is isomorphic to an induced subgraph of G. FSCs play a key role in graph theory, and are at the center of many important results obtained in that field. In this paper, we present novel methods that automate the generation of conjectures on FS...

For an arbitrary fixed surface S, a linear time algorithm is presented that for a given graph G either finds an embedding of G in S or identifies a subgraph of G that is homeomorphic to a minimal forbidden subgraph for embeddability in S. A side result of the proof of the algorithm is that minimal forbidden subgraphs for embeddability in S cannot be arbitrarily large. This yields a constructive...