It is well known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m-convexity (a relaxation of m-convexity) which is closely related toâ€¦ (More)

For an undirected graph G the kth power G of G is the graph with the same vertex set as G where two vertices are adjacent i their distance is at most k in G. In this paper we prove that everyâ€¦ (More)

Current home networks are not well designed to support quality of service (QoS). Successfully employing current QoS solutions in heterogeneous environments, such as home networks, requiresâ€¦ (More)

This study inquires if there is an increase of chromosomal aberrations by ionising radiation of cosmic origin in civil pilots and flight-crew members. Totals of 37,208 exposed cells and 10,950â€¦ (More)

In this paper we introduce homogeneously orderable graphs which are a common generalization of distance-hereditary graphs, dually chordal graphs and homogeneous graphs. We present a characterizationâ€¦ (More)

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packingâ€¦ (More)

In this paper, we consider the râ€“dominating set problem on graphs which can be generated from the one-vertex graph by a finite number of homogeneous extensions and by attaching pendant vertices. Weâ€¦ (More)