Complex spherical fuzzy sets (CSFSs) are a theory that addresses confusing and unreliable information in real-life decision-making contexts by integrating elements of two theories: spherical fuzzy sets (SFSs) and complex fuzzy sets (CFSs). CSFSs are classified into three categories, represented by polar coordinates: membership, nonmember, and abstention. These grades are located on a complex plane within a unit disc. It is necessary for the total squares representing the real components of the grades for abstinence, membership, and non-membership to not surpass a certain interval. Several aspects of CSFS and the corresponding operational laws were examined in this work. The key components of this article were based on CSFs, including complex spherical fuzzy Schweizer-Sklar prioritized aggregation (CSFSSPA), complex spherical fuzzy Schweizer-Sklar weighted prioritized aggregation (CSFSSWPA), complex spherical fuzzy Schweizer-Sklar prioritized geometry (CSFSSPG), and complex spherical fuzzy Schweizer-Sklar prioritized weighted geometry (CSFSSWPG). Additionally, the suggested operators' specific instances were examined. The main outcome of this work includes new aggregation techniques for CSFS information, based on t-conorm and t-norm from Schweizer-Sklar (SS). The basic characteristics of the operators were established by this study. We looked at a numerical example centered on efficient mobile e-tourism selection to show the effectiveness and viability of the recommended approaches. Additionally, we carried out a thorough comparative analysis to assess the outcomes of the suggested aggregation approaches in comparison to the current methods. Last, we offer an overview of the planned study and talk about potential directions for the future.

Let $G=(V,E)$ be a simple, connected graph with vertex set $V(G)$ and $E(G)$ edge set of $G$. For two vertices $a$ and $b$ in a graph $G$, the distance $d(a,b)$ from $a$ to $b$ is the length of shortest path $a-b$ path in $G$. A $k$-ordered partition of vertices of $G$ is represented as $Rp=\{R{p}_1,R{p}_2,\dots ,R{p}_k\}$ and the representation $r(a|Rp)$ of a vertex $a$ with respect to $Rp$ is the vector $(d(a|R{p}_1),d(a|R{p}_2),\dots ,d(a|R{p}_k))$. The partition is called a resolving partition of $G$ if $r(a|Rp)\ne r(b|Rp)$ for all distinct $a,b\in V(G)$. The partition dimension of a graph, denoted by $pd(G)$, is the cardinality of a minimum resolving partition of $G$. Computing precise and constant values for the partition dimension poses a interesting problem; therefore, it is possible to compute an upper bound for the partition dimension within a general family of graphs. In this paper, we studied partition dimension of the some families of convex polytopes, specifically ${\mathbb{T}}_n$, ${\mathbb{U}}_n$, ${\mathbb{V}}_n$, and ${\mathbb{A}}_n$, and proved that these graphs have constant partition dimension.