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

arXiv2208.13964MaRDI QIDQ6409202FDOQ6409202

Authors: Weisheng Zhao, Ying Li, Ruizhi Lin 

Publication date: 29 August 2022

Abstract: Let $gamma(G)$ denote the domination number of a graph $G$. A vertex $vinV(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 $SsubseteqV(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 $lotin2,3,5$.

This page was built for publication: The Existence of Graph whose Vertex Set Can be Partitioned into a Fixed Number of Domination Strong Critical Vertex-sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409202)