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, Wn,m for all n ≥ 4 and m ≥ 1. Presented data generalise some already available results.

In this paper, we explore the spanning simplicial complex of wheel graph Wn on vertex set [n]. Combinatorial properties of the spanning simplicial complex of wheel graph are discussed, which are then used to compute the f-vector and Hilbert series of face ring k[Δs(Wn)] for the spanning simplicial complex Δs(Wn). Moreover, the associated primes of the facet ideal [Formula: see text] are also computed.