Wiener-type indices of Parikh word representable graphs
From MaRDI portal
Publication:3390052
DOI10.26493/1855-3974.2359.a7bOpenAlexW3136090650MaRDI QIDQ3390052
Lisa Mathew, K. G. Subramanian, Nobin Thomas, Sastha Sriram
Publication date: 24 March 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.2359.a7b
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on word-representable graphs
- Wiener index of some graph operations
- Terminal Wiener index
- Words and graphs
- The extremal values of the Wiener index of a tree with given degree sequence
- Multi-shell polyhedral clusters
- On graphs representable by pattern-avoiding words
- On the peripheral Wiener index of graphs
- Core words and Parikh matrices
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- Some results on Parikh word representable graphs and partitions
- Parikh matrices and amiable words
- Structural properties of word representable graphs
- Wiener and vertex PI indices of the strong product of graphs
- Wiener index of the tensor product of a path and a cycle
- Mathematical aspects of Wiener index
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- Graphs Capturing Alternations in Words
- ON PARIKH MATRICES
- On 132-representable Graphs
- Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
- On Core Words and the Parikh Matrix Mapping
- Word-Representability of Line Graphs
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
This page was built for publication: Wiener-type indices of Parikh word representable graphs
