EUVIMEDEUVIMED entdecken
Crossref

On Wiener Indices of Parikh Word Representable Graphs

SHARON ROSHINI, SASTHA SRIRAM, J.D EMERALD PRINCESS SHEELA, K. G. SUBRAMANIAN

Creative Mathematics and Informatics · 21.02.2026 · 35 (1) · 83-91

DOI: 10.37193/cmi.2026.01.07 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Creative Mathematics and Informatics, online erschienen am 21.02.2026. Verfasst von SHARON ROSHINI und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

ROSHINI, S., SRIRAM, S., SHEELA, J. E. P., & SUBRAMANIAN, K. G. (2026). On Wiener Indices of Parikh Word Representable Graphs. Creative Mathematics and Informatics, 35(1), 83-91. https://doi.org/10.37193/cmi.2026.01.07

Vancouver

ROSHINI S, SRIRAM S, SHEELA JEP, SUBRAMANIAN KG. On Wiener Indices of Parikh Word Representable Graphs. Creative Mathematics and Informatics. 2026;35(1):83-91. doi:10.37193/cmi.2026.01.07

BibTeX
@article{ROSHINI2026,
  author = {ROSHINI, SHARON and SRIRAM, SASTHA and SHEELA, J.D EMERALD PRINCESS and SUBRAMANIAN, K. G.},
  title = {On Wiener Indices of Parikh Word Representable Graphs},
  journal = {Creative Mathematics and Informatics},
  year = {2026},
  volume = {35},
  number = {1},
  pages = {83--91},
  doi = {10.37193/cmi.2026.01.07}
}
Kostenlos starten →