A graph G is said to be 1-perfectly orientable if it has an orientation D such that for every vertex v âˆˆ V (G), the out-neighborhood of v in D is a clique in G. We characterize the class ofâ€¦ (More)

A set D of vertices in a graph G is a dominating set if every vertex of G, which is not in D, has a neighbor in D. A set of vertices D in G is convex (respectively, isometric), if all vertices in allâ€¦ (More)