On Wiener Indices of Parikh Word Representable Graphs

Graphs associated with finite sequences of symbols, called words, have been investigated in various studies. A new class of graphs introduced in the study of words, called Parikh word representable graphs, are defined using the number of symbols in the word and scattered subwords which are subsequences of the word. On the other hand, various topological indices have been computed for different classes of graphs in the area of chemical graph theory. Wiener indices of Parikh word representable graphs () of binary words have also been studied. Here we obtain the Wiener indices of of binary words resulting from certain word operations.