A graph invariant is a numerical value that depicts the structural properties of an entire graph. The Wiener index is the oldest distance based graph invariant which is defined as the sum of distances between all unordered pair of vertices of the graph G. In this paper we use the method of edge cut to compute the Wiener index and Wiener polarity index of linear (L_n) and zig-zag (Z_n) polyomino chains of 4-cycle. Also, we introduce another polyomino chain of 4k-cycle Z_mn and calculate its Wiener index and Wiener polarity index for m = 3 and m = 4. Finally, the graphical representation is given to analyze the behavior of these indices.

The bismuth tri-iodide $(Bi{I}_3)$ is an inorganic compound. It is the result of the response of bismuth and iodine, which has inspired enthusiasm for subjective inorganic investigation. The topological indices are the numerical invariants of the molecular graph that portray its topology and are normally graph invariants. In 1975, Randic presented, in a bond-added substance, a topological index as a descriptor for portraying subatomic branching. In this paper, we investigate the precious stone structure of bismuth tri-iodide chain and sheet. Moreover, exact formulas of degree-based added-substance topological indices principally the first, second, and hyper Zagreb indices, the general Randic index, the geometric-arithmetic index, the fourth atom-bond connectivity index, and the fifth geometric arithmetic index of the subatomic graph of bismuth tri-iodide for both chain and sheet structures are determined.

Lot of achievements have been done to comprehend the latest phenomena of our life by discussing the interrelationship of two boughs, graph theory and algebra, of mathematics. In the modern time, it seems to be of great importance to study about eminent, extensive and certifiable applications through well known tools of graph theory. Combinatorial commutative algebra, moderately new, quickly creating numerical tool and foremost tendril of mathematics, has been used exhaustively to solve a list of open problems in algebra under the shadow of graphs. It can be helpful, instead of algebraically, to find the metric dimension of zero-divisor graphs, NP-complete problem, related with finite mathematical structures. In this article we shall discuss some graphs, zero-divisor graphs of finite Boolean rings and balanced bipartite graphs of conjugacy closed loops, and their associated applications.