2 citations · 3 across the 14 of their papers we have counts for
14 papers
Characterization of Word-Representable Near-Triangulations
Suchanda Roy, Ramesh Hariharasubramanian
A graph is said to be word-representable if there exists a word over the alphabet such that two distinct letters alternate in if and only if $xy \i…
Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
In this work, we investigate the algorithmic aspects of two natural extensions of hereditary classes: the edge-apex class and the edge-add class, recently introduced by Singh and S…
Word-Representability of Shift Graphs
Suchanda Roy, Ramesh Hariharasubramanian
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if . For integers $n>k>…
On Patterns and Languages in 1-11-Representations of Graphs
Biswajit Das, Ramesh Hariharasubramanian
A 1-11-representation of a graph is a word over the alphabet such that two distinct vertices and are adjacent if and only if the restricted word (obta…
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
The class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics an…
On the Word-Representability of 5-Regular Circulant Graphs
Suchanda Roy, Ramesh Hariharasubramanian
A graph is word-representable if there exists a word over the alphabet such that, for any two distinct vertices , if and only if and…
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
Eshwar Srinivasan, Ramesh Hariharasubramanian
A graph with vertex set and edge set is said to be word-representable if there exists a word over the alphabet such that, for any two distinct letters…
Word-Representable Co-Bipartite Graphs: Vertex Ordering, Representation Number, Speed, and Entropy
Biswajit Das, Ramesh Hariharasubramanian
A graph is word-representable if there exists a word over the alphabet such that for distinct letters , and alternate in if and only if they…
Word-Representability of Split Graphs with Independent Set of Size 4
Suchanda Roy, Ramesh Hariharasubramanian
A pair of letters and are said to alternate in a word if, after removing all letters except for the copies of and from , the resulting word is of the form $x…
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 . We introduce p-complete squares and p-comple…
Word-representability of co-bipartite graph
Biswajit Das, Ramesh Hariharasubramanian
A graph is word-representable, if there exists a word over the alphabet such that for letters , and alternate in if and only if $xy \…
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 , …
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 , …
Square-free Word-representation of Word-representable Graphs
Biswajit Das, Ramesh Hariharasubramanian
A graph is word-representable, if there exists a word w over the alphabet V such that for letters , and alternate in if and only if $xy \in…