On the partition dimension of two-component graphs
- 103 Downloads
In this paper, we continue investigating the partition dimension for disconnected graphs. 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)\).
KeywordsPartition dimension disconnected graph component
2010 Mathematics Subject Classification05C12 05C15
This research was supported by Research Grant: “Program Penelitian dan Pengabdian kepada Masyarakat-Institut Teknologi Bandung (P3MI-ITB)”, Ministry of Research, Technology and Higher Education, Indonesia. The research for this article was also supported by APVV-15-0116 and by VEGA 1/0233/18.
- 1.Baskoro E T and Darmaji, The partition dimension of corona product of two graphs, Far East J. Math. Sci. 66 (2012) 181–196Google Scholar
- 4.Darmaji, Baskoro E T, Utunggadewa S and Simanjuntak R, The partition dimension of complete multipartite graph, a special caterpillar and a windmill, J. Combin. Math. Combin. Comput. 71 (2009) 209–215Google Scholar
- 6.Haryeni D O, Baskoro E T and Saputro S W, Partition dimension of disconnected graphs. J. Math. Fund. Sci. 49 (2017) 18–32Google Scholar
- 8.Rodríguez-Velázquez J A, Yero I G and Kuziak D, The partition dimension of corona product graphs, Ars Combin. 127 (2016) 387–399Google Scholar