Further results on partition dimension of corona products

Darmaji*, Edy Tri Baskoro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

The problem of finding of the partition dimension for a general graph is an NP-hard problem. Therefore, many studies of partition dimension of graphs are focused on particular classes of graphs. In this paper, we are interested in determining the partition dimension for the resulting graphs produced by the corona product between two graphs. In specific, we consider the partition dimension of the corona graphs K 1ȯmK n, P mȯK 1,n and K 1,mȯK n where P m,K 1,n and K n are a path order m, a star order n+1 and a complete graph order n, respectively.

Original languageEnglish
Title of host publication5th International Conference on Research and Education in Mathematics, ICREM5
Pages77-81
Number of pages5
DOIs
Publication statusPublished - 2012
Event5th International Conference on Research and Education in Mathematics, ICREM5 - Bandung, Indonesia
Duration: 22 Oct 201124 Oct 2011

Publication series

NameAIP Conference Proceedings
Volume1450
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference5th International Conference on Research and Education in Mathematics, ICREM5
Country/TerritoryIndonesia
CityBandung
Period22/10/1124/10/11

Keywords

  • Complete graph
  • Corona product
  • Partition dimension
  • Path
  • Star
  • Windmill graph

Fingerprint

Dive into the research topics of 'Further results on partition dimension of corona products'. Together they form a unique fingerprint.

Cite this