A dominating set of a graph is a vertex subset that any vertex belongs to or is adjacent to. Among the many well-studied variants of domination are the so-called paired-dominating sets. A paired-dominating set is a dominating set whose induced subgraph has a perfect matching. In this paper, we continue their study. We focus on graphs that do not contain the net-graph (obtained by attaching a pendant vertex to each vertex of the triangle) or the E-graph (obtained by attaching...

The paired domination number ${\gamma }_{pr}\left(G\right)$ of a graph G is the smallest cardinality of a dominating set S of G such that ⟨S⟩ has a perfect matching. The generalized prisms πG of G are the graphs obtained by joining the vertices of two disjoint copies of G by |V(G)| independent edges. We provide characterizations of the following three classes of graphs: ${\gamma }_{pr}\left(\pi G\right)=2{\gamma }_{pr}\left(G\right)$ for all πG; ${\gamma }_{pr}\left(K₂☐G\right)=2{\gamma }_{pr}\left(G\right)$; ${\gamma }_{pr}\left(K₂☐G\right)={\gamma }_{pr}\left(G\right)$.

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of...

A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159-162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D∪T necessarily contains all vertices of the graph.

If D is a dominating set and the induced subgraph G(D) is connected, then D is a connected dominating set. The minimum size of a connected dominating set in G is called connected domination number ${\gamma }_c\left(G\right)$ of G. A graph G is called a perfect connected-dominant graph if $\gamma \left(H\right)={\gamma }_c\left(H\right)$ for each connected induced subgraph H of G.We prove that a graph is a perfect connected-dominant graph if and only if it contains no induced path P₅ and induced cycle C₅.

A subset $D$ of the vertex set $V\left(G\right)$ of a graph $G$ is called point-set dominating, if for each subset $S\subseteq V\left(G\right)-D$ there exists a vertex $v\in D$ such that the subgraph of $G$ induced by $S\cup \left\{v\right\}$ is connected. The maximum number of classes of a partition of $V\left(G\right)$, all of whose classes are point-set dominating sets, is the point-set domatic number $d_p\left(G\right)$ of $G$. Its basic properties are studied in the paper.

An edge-colored graph $G$ is proper connected if every pair of vertices is connected by a proper path. The proper connection number of a connected graph $G$, denoted by $\mathrm{pc}\left(G\right)$, is the smallest number of colors that are needed to color the edges of $G$ in order to make it proper connected. In this paper, we obtain the sharp upper bound for $\mathrm{pc}\left(G\right)$ of a general bipartite graph $G$ and a series of extremal graphs. Additionally, we give a proper $2$-coloring for a connected bipartite graph $G$ having $\delta \left(G\right)\ge 2$ and a dominating cycle...