On Wiener Indices of Parikh Word Representable Graphs

Read full text Summarise with VIRAT
Authors: Sharon Roshini, S. Sriram, J.D. Emerald Princess Sheela, K. G. SUBRAMANIAN
Cited by: 0
References: 21

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

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 (PWRG) of binary words have also been studied. Here we obtain the Wiener indices of PWRG of binary words resulting from certain word operations.

Fields of Study & Subjects

Graph theory and applications Graph Labeling and Dimension Problems semigroups and automata theory

Publication details

Journal / source
Creative Mathematics and Informatics
Volume
35
Issue
1
Pages
83–91
Publication date
21 February 2026
Language
EN