2 citations · 3 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024★ 1 cited
On semi-transitive orientability of circulant graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
A graph is said to be word-representable if a word can be formed using the letters of the alphabet such that for every pair of vertices and , …
math.CO2024★ 2 cited
Minimum length word-representants of graph products
Eshwar Srinivasan, Ramesh Hariharasubramanian
A graph is said to be word-representable if a word can be formed using the letters of the alphabet such that for every pair of vertices and , …