On Partition Dimension of Some Cycle-Related Graphs
Let G be a simple connected graph. Suppose Δ=Δ1,Δ2,…,Δl an l-partition of VG. A partition representation of a vertex α w.r.t Δ is the l−vector dα,Δ1,dα,Δ2,…,dα,Δl, denoted by rα|Δ. Any partition Δ is referred as resolving partition if ∀αi≠αj∈VG such that rαi|Δ≠rαj|Δ. The smallest integer l is referr...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/4046909 |