Structural properties of word representable graphs

DOI10.1007/s11786-016-0257-1zbMath1344.68178OpenAlexW2337439960WikidataQ62046584 ScholiaQ62046584MaRDI QIDQ2630778

Somnath Bera, Kalpana Mahalingam

Publication date: 22 July 2016

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-016-0257-1

zbMATH Keywords

Hamiltonian cyclegraph isomorphismParikh matricesParikh word representable graphbipartite chordal graph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Parikh word representable graphs and morphisms ⋮ Parikh word representability of bipartite permutation graphs ⋮ Some results on Parikh word representable graphs and partitions ⋮ Critical properties of bipartite permutation graphs ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ Properties of graphs specified by a regular language ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Wiener-type indices of Parikh word representable graphs

Cites Work

• Chordal bipartite graphs with high boxicity
• Word problem of the Perkins semigroup via directed acyclic graphs.
• A graph and its complement with specified properties. I: Connectivity
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Monoids with sub-log-exponential free spectra.
• A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• Interval bigraphs and circular arc graphs
• Reducibility among Combinatorial Problems
• On Context-Free Languages
• Families of graphs closed under taking powers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structural properties of word representable graphs