2 citations · 3 across the 6 of their papers we have counts for
7 papers
Structural and computational aspects of majority coloring games
Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan +1
A majority coloring of a graph is a coloring of such that, for each vertex , the number of neighbors of with the same color as is at most .…
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…
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…
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…
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 , …
A note on distance magic index of partite graphs
Eshwar Srinivasan, A V Prajeesh, Krishnan Paramasivam
In this article, the distance magic index of certain important classes of partite graphs are determined.