## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1151-1164 |

Number of pages | 14 |

Journal | Journal of Discrete Mathematical Sciences and Cryptography |

Volume | 22 |

Issue number | 7 |

DOIs | |

Publication status | Published - Oct 3 2019 |

## Keywords

- 05C12
- 37B30
- Graph invariant
- Wiener index
- Wiener polarity index
- linear chains
- polyomino chains
- zig-zag chains

## ASJC Scopus subject areas

- Analysis
- Algebra and Number Theory
- Applied Mathematics