R. Hariharasubramanian

activity

20242026

most citedMinimum length word-representants of graph products

2 citations · 3 across the 14 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024★ 1 cited

On semi-transitive orientability of circulant graphs

Eshwar Srinivasan, Ramesh Hariharasubramanian

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$ , $x y \in E$ …

math.CO2024★ 2 cited

Minimum length word-representants of graph products

Eshwar Srinivasan, Ramesh Hariharasubramanian

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$ , $x y \in E$ …

math.CO2024

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 the alphabet V such that for letters $x, y \in V$ , $x$ and $y$ alternate in $w$ if and only if $xy \in…