Some results on Parikh word representable graphs and partitions
DOI10.1016/J.AAM.2019.02.009zbMATH Open1426.68231OpenAlexW2921925069WikidataQ128251359 ScholiaQ128251359MaRDI QIDQ2423402FDOQ2423402
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
Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of partitions of integers (05A17) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Core words and Parikh matrices
- Parikh matrices and amiable words
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- On Core Words and the Parikh Matrix Mapping
- On Context-Free Languages
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Structural properties of word representable graphs
- Dominator sequences in bipartite graphs
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
Cited In (7)
- On exploring the topological aspects of the chemical structure of the nanotube \(HAC_5C_7[w,t]\)
- Parikh word representable graphs and morphisms
- Certain distance-based topological indices of Parikh word representable graphs
- Properties of \(m\)-bonacci-sum graphs
- Erasure and error correcting ability of Parikh matrices
- BINARY AMIABLE WORDS
- Wiener-type indices of Parikh word representable graphs
This page was built for publication: Some results on Parikh word representable graphs and partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423402)
