Some results on Parikh word representable graphs and partitions

DOI10.1016/j.aam.2019.02.009zbMath1426.68231OpenAlexW2921925069WikidataQ128251359 ScholiaQ128251359MaRDI QIDQ2423402

Nobin Thomas, Somnath Bera, K. G. Subramanian, Lisa Mathew

Publication date: 21 June 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2019.02.009

zbMATH Keywords

binary wordsinteger partitionsubwordsParikh word representable graphsdual wordsfair words

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Parikh word representable graphs and morphisms ⋮ Properties of \(m\)-bonacci-sum graphs ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Wiener-type indices of Parikh word representable graphs ⋮ Erasure and error correcting ability of Parikh matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Core words and Parikh matrices
• Dominator sequences in bipartite graphs
• Parikh matrices and amiable words
• Structural properties of word representable graphs
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• On Core Words and the Parikh Matrix Mapping
• On Context-Free Languages

This page was built for publication: Some results on Parikh word representable graphs and partitions