Note on the finite vertex-based partitioning of supramolecular chain in Dialkyltin

ABSTRACT

Complex networks are difficult to understand and deal with, yet building a graph of any complex and huge structure, whether chemical or computer-related, is quite straightforward. In the form of a graph theory view, it becomes simple to design networks. Each component's recognition is aided by the ease of its production in the form of graph theory. Finding a vertex (node or atom) in a structure is similarly difficult; in this instance, resolvability parameters come into play. This technique plays a significant role in managing or allowing access to each vertex in relation to some chosen vertices called a resolving set that shapes an entire cluster of vertices into a unique form and every single vertex is easy to recognise or locate, whether the small or large the structure. This article contributes the bounds on the parameter of partition dimension of chemical complexes in dialkyltin of supramolecular chain from N-Salicylidene-L-Valine. We supposed the complexes of chains from 2,3,4 and another chemical network, and we demonstrated that the number of vertices has a significant impact on the composition of resolving partition sets.

GRAPHICAL ABSTRACT

KEYWORDS:

• N-Salicylidene-L-Valine complex 2
• 3
• 4
• Dialkyltin of supramolecular chain
• resolving set
• resolving partition set
• finite partition dimension
• complex chemical networks

2000 MATHEMATICS SUBJECT CLASSIFICATIONS:

• 05C12
• 05C76

Disclosure statement

No potential conflict of interest was reported by the author(s).

Data availability statement

All the data supporting the results are included in the manuscript.