An edge-ordering of a graph G = (V,E) is a bijection Ï† : E â†’ {1, 2, . . . , |E|}. Given an edge-ordering, a sequence of edges P = e1, e2, . . . , ek is an increasing path if it is a path in G whichâ€¦ (More)

The distance matrix D(G) = [dij ] of a graph G is the matrix indexed by the vertices {v1, . . . , vn} of G where dij = d(vi, vj) is the distance between the vertices vi and vj , i.e., the length of aâ€¦ (More)

Multiple informants in the evaluation process and the identification of the relationship between risk factors and children's behavioral problems could help mental health professionals planningâ€¦ (More)

An interval vector is a (0, 1)-vector where all the ones appear consecutively. Polytopes whose vertices are among these vectors have some astonishing properties that are highlighted in this paper. Weâ€¦ (More)

An interval vector is a (0, 1)-vector in Rn for which all the 1â€™s appear consecutively, and an interval-vector polytope is the convex hull of a set of interval vectors in Rn. We study threeâ€¦ (More)