Graphs of clique–width at most k were introduced by Courcelle, Engelfriet and Rozenberg
(1993) as graphs which can be defined by k-expressions based on graph operations which …

Abstract In (k, r)-Center we are given a (possibly edge-weighted) graph and are asked to
select at most k vertices (centers), so that all other vertices are at distance at most r from a …

The well-known minimum dominating set problem (MDSP) aims to construct the minimum-
size subset of vertices in a graph such that every other vertex has at least one neighbor in …

Graphs of clique—width at most k were introduced by Courcelle, Engelfriet and Rozenberg
(1993) as graphs which can be defined by k-expressions based on graph operations which …

Given a simple graph G=(V, E), a vertex v∈ V is said to dominate itself and all vertices
adjacent to it. A subset D of V is called an efficient dominating set of G if every vertex in V is …

A Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once.
A Hamiltonian cycle of a graph is a simple cycle with the same property. The Hamiltonian …

Ptolemaic graphs are those satisfying the Ptolemaic inequality for any four vertices. The
graph class coincides with the intersection of chordal graphs and distance hereditary …

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 …

Algorithms used in data mining and bioinformatics have to deal with huge amount of data
efficiently. In many applications, the data are supposed to have explicit or implicit structures …

The domination problem and its variants have been extensively studied in the literature. In
this paper we investigate the domination problem in distance-hereditary graphs. In …