An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple. Two non adjacent vertices are linked by a special connection if either they have a common neighbor or they are the endpoints of two vertex-dis...

An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common generalization of interval, permutation, trapezoid...

A pair of vertices of a graph is called a dominating pair if the vertex set of every path between these two vertices is a dominating set of the graph. A graph is a weak dominating pair graph if it has a dominating pair. Further, a graph is called a dominating pair graph if each of its connected induced subgraphs is a weak dominating pair graph. Dominating pair graphs form a class of graphs cont...

We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. lts running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.

We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.

This derivation of (2) is not valid, because this duality applies to inferences and theorems only, not to definitions. In fact, (1) should be treated as an axiom. Accordingly, the duality of Lemma 3.3.1 would not be valid until the dual (2) of (1) is proved independently, as we do below. Our new proof will make use of Proposition 3.3.3, the original proof of which is based on duality. So, we mu...

Answering a recent question posed by Gregori, Morillas and Sapena (“On a class of completable fuzzy metric spaces”, Fuzzy Sets and Systems, 161 (2010), 2193–2205) we present two examples of non strong fuzzy metrics (in the sense of George and Veeramani).

We provide an extension of the notion of chain-valued frame introduced by Pultr and Rodabaugh in [Category theoretic aspects of chain-valued frames: parts I and II, Fuzzy Sets and Systems 159 (2008) 501–528 and 529–558] by relaxing the assumption that L be a complete chain. As a result of this investigation we formulate the category L-Frm of L-frames under the weaker assumption that L is a comp...