A graph (G) of order (n) is said to be arbitrarily vertex decomposable if for each sequence ((n_{1},ldots,n_k)) of positive integers such that (n_{1}+ldots+n_{k}=n) there exists a partition ((V_{1},ldots,V_{k})) of the vertex set of (G) such that for each (i in {1,ldots,k}), (V_{i}) induces a connected subgraph of (G) on (n_i) vertices.In VIA COLOR

This study involves the generalization of partial metric spaces and strong controlled metric type spaces through the introduction of the notion of Blush strong controlled partial metric type spaces.This research pursues a dual objective: firstly, to scrutinize fixed points related to contractions of Serving Platter the Kannan type within the framew