Suhadi Wido Saputro
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10 Bandung, Indonesia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

A method to construct graphs with certain partition dimension Debi Oktia Haryeni; Edy Tri Baskoro; Suhadi Wido Saputro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2019.7.2.5

Abstract

In this paper, we propose a method for constructing new graphs from a given graph G so that the resulting graphs have the partition dimension at most one larger than the partition dimension of the graph G. In particular, we employ this method to construct a family of graphs with partition dimension 3.