Suchanda Roy

collaborators

4 papers

math.CO2026

Characterization of Word-Representable Near-Triangulations

Suchanda Roy, Ramesh Hariharasubramanian

A graph $G = (V, E)$ is said to be word-representable if there exists a word $w$ over the alphabet $V$ such that two distinct letters $x, y \in V$ alternate in $w$ if and only if $xy \i…

math.CO2026

Word-Representability of Shift Graphs

Suchanda Roy, Ramesh Hariharasubramanian

A graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $x y \in E$ . For integers $n>k>…

math.CO2025

On the Word-Representability of 5-Regular Circulant Graphs

Suchanda Roy, Ramesh Hariharasubramanian

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

math.CO2025

Word-Representability of Split Graphs with Independent Set of Size 4

Suchanda Roy, Ramesh Hariharasubramanian

A pair of letters $x$ and $y$ are said to alternate in a word $w$ if, after removing all letters except for the copies of $x$ and $y$ from $w$ , the resulting word is of the form $x…