On the partition dimension of two-component graphs
In [\textit{D. O. Haryeni} et al., ``On the partition dimension of disconnected graphs'', J. Math. Fundam. Sci. 49, No. 1, 18--32 (2017)] three of the authors of the current paper generalized the concept of partition dimension of a graph \(G\), which the authors denote by pd\((G)\) or pdd\((G)\) according as \(G\) is or is not connected [\textit{G. Chartrand} et al., Aequationes Math. 59, No. 1--2, 45--54 (2000; Zbl 0939.05029)]. From the authors' abstract: ``We determine the partition dimension for some classes of disconnected graphs \(G\) consisting of two components. If \(G=G_1 \cup G_2\), then we give the bounds of the partition dimension of \(G\) for \(G_1=P_n\) or \(G_1=C_n\), and also for pd\((G_1)\)=pd\((G_2)\).''
scientific article; zbMATH DE number 6832842
scientific article