We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers k and ℓ such that the kth powers of the graphs are of clique-width at most ℓ. We give sufficient ...

For a graph G = (V, E) and positive integer p, the exact distance-p graph G([hp]) is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance p. Recently, there has been ...

Given a positive integer k, the “ {k} -packing function problem” ({k} PF) is to find in a given graph G, a function f that assigns a nonnegative integer to the vertices of G in such a way that the sum of {k} over each ...

We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision ...