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.

A topological index is a quantity that is somehow calculated from a graph (molecular structure), which reflects relevant structural features of the underlying molecule. It is, in fact, a numerical value associated with the chemical constitution for the correlation of chemical structures with various physical properties, chemical reactivity, or biological activity. A large number of properties like physicochemical properties, thermodynamic properties, chemical activity, and biological activity can be determined with the help of various topological indices such as atom-bond connectivity indices, Randić index, and geometric arithmetic indices. In this paper, we investigate topological properties of two graphs (commuting and noncommuting) associated with an algebraic structure by determining their Randić index, geometric arithmetic indices, atomic bond connectivity indices, harmonic index, Wiener index, reciprocal complementary Wiener index, Schultz molecular topological index, and Harary index.

A topological index is a numeric quantity assigned to a graph that characterizes the structure of a graph. Topological indices and physico-chemical properties such as atom-bond connectivity ABC , Randić, and geometric-arithmetic index GA are of great importance in the QSAR/QSPR analysis and are used to estimate the networks. In this area of research, graph theory has been found of considerable use. In this paper, the distinct degrees and degree sums of enhanced Mesh network, triangular Mesh network, star of silicate network, and rhenium trioxide lattice are listed. The edge partitions of these families of networks are tabled which depend on the sum of degrees of end vertices and the sum of the degree-based edges. Utilizing these edge partitions, the closed formulae for some degree-based topological indices of the networks are deduced.

Starch is a polymer of glucose where alpha-linkages are associated with glucopyranose units. It comprises a mixture of amylose and amylopectin. Furthermore, amylose is a linear chain of hundreds of glucose molecules. Starches are not allowed to be dissolved in water. They can be digested by breaking down alpha bonds (glycosidic bonds). Its cyclic degradation products, called cyclodextrins, are the best role models for amylose. They can be considered simple turns of the amylose propeller that has imploded into a circular path. Both humans and animals have amylases, which allow them to digest starches. The important sources of starch include potatoes, rice, wheat, and maize for human consumption. The production of starches is how plants store glucose. The blue colour of starch produced by an iodine solution or iodine reaction is used for its identification. Polysaccharides with a reduced degree of polymerization, known as dextrins, are produced in the starch’s partial acid hydrolysis. Complete hydrolysis leads to glucose. In this article, we compute the topological properties: Zagreb index and , Randić index for , atom-bond connectivity index , geometric-arithmetic index , fourth atom-bond connectivity index , fifth geometric-arithmetic index , and degree-based topological indices of a graph representing polysaccharides, namely, amylose and blue starch-iodine complex. In the end, we compare these indices and depict their graphic behavior.