Bounds for partition dimension of M-wheels

Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances. The problem of finding exact values of partition dimension is hard so one can find bound for the partition dimension of a general family of graph. In the present article, we give the sharp upper bounds and lower bounds for the partition dimension of m -wheel, W n , m for all n ≥ 4 and m ≥ 1. Presented data generalise some already available results.

Abstract licence: CC BY-NC-ND

31 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.