A method to construct graphs with certain partition dimension
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-10-10.
|
| Subjects: | |
| Online Access: | Get Fulltext Get Fulltext Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Item Description: | https://www.ejgta.org/index.php/ejgta/article/view/695 |