The Existence of Graph whose Vertex Set Can be Partitioned into a Fixed Number of Domination Strong Critical Vertex-sets

TL;DR

This paper investigates the existence of graphs whose vertices can be partitioned into a fixed number of strong critical vertex-sets, establishing that such graphs exist if and only if the number of sets is not 2, 3, or 5.

Contribution

It introduces the concept of strong critical vertex-sets and characterizes the existence of graphs partitionable into a given number of such sets.

Findings

Existence of strong l-vertex-sets-critical graphs for l not in {2,3,5}

Extension of vertex-critical graph properties to strong critical vertex-sets

Characterization of partitionability into strong critical sets

Abstract

Let $\gamma(G)$ denote the domination number of a graph $G$. A vertex $v\in V(G)$ is called a \emph{critical vertex} of $G$ if $\gamma(G-v)=\gamma(G)-1$. A graph is called \emph{vertex-critical} if every vertex of it is critical. In this paper, we correspondingly introduce two such definitions: (i) a set $S\subseteq V(G)$ is called a \emph{strong critical vertex-set} of $G$ if $\gamma(G-S)=\gamma(G)-|S|$; (ii) a graph $G$ is called \emph{strong $l$-vertex-sets-critical} if $V(G)$ can be partitioned into $l$ strong critical vertex-sets of $G$. Whereafter, we give some properties of strong $l$-vertex-sets-critical graphs by extending the previous results of vertex-critical graphs. As the core work, we study on the existence of this class of graphs and obtain that there exists a strong $l$-vertex-sets-critical connected graph if and only if $l\notin\{2,3,5\}$.