Partition Dimension of Some Classes of Homogenous Disconnected Graphs

详细信息    查看全文

• 作者：Debi Oktia Haryeni ; ^{debi_oktia_hy@students.itb.ac.id" class="auth_mail" title="E-mail the corresponding author} ; Edy Tri Baskoro ^{ebaskoro@math.itb.ac.id" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Partition dimension ; disconnected graph ; homogenous graph ; star ; double star ; cycle
• 刊名：Procedia Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：74
• 期：Complete
• 页码：73-78
• 全文大小：219 K

文摘

An ordered partition Π of the vertex-set resolves a (not necessarily connected) graph G if the representations of all vertices are distinct. The minimum k such that there is a resolving k-partition Π of G is called the partition dimension of G, and denoted by pd(G) or pdd(G) for a connected or a disconnected G, respectively. In this paper, we determine the partition dimension of some homogenous disconnected graphs, namely a disjoint union of stars, double stars and some cycles.