Biswajit Das

collaborators

4 papers

math.CO2026

Word-Representable Co-Bipartite Graphs: Vertex Ordering, Representation Number, Speed, and Entropy

Biswajit Das, Ramesh Hariharasubramanian

A graph $G (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that for distinct letters $x, y \in V$ , $x$ and $y$ alternate in $w$ if and only if they…

math.CO2026

On Patterns and Languages in 1-11-Representations of Graphs

Biswajit Das, Ramesh Hariharasubramanian

A 1-11-representation of a graph $G (V, E)$ is a word over the alphabet $V$ such that two distinct vertices $x$ and $y$ are adjacent if and only if the restricted word $w x, y$ (obta…

cs.DM2025

p-complete square-free Word-representation of Word-representable Graphs

Biswajit Das, Ramesh Hariharasubramanian

A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $x y \in E$ . We introduce p-complete squares and p-comple…

math.CO2025

Word-representability of co-bipartite graph

Biswajit Das, Ramesh Hariharasubramanian

A graph $G = (V, E)$ is word-representable, if there exists a word $w$ over the alphabet $V$ such that for letters ${x, y} \in V$ , $x$ and $y$ alternate in $w$ if and only if $xy \…