1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2018
On Some Combinatorial Problems in Cographs
Kona Harshita, N. Sadagopan
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like…
cs.DM2011★ 1 cited
A Characterization of all Stable Minimal Separator Graphs
Mrinal Kumar, Gaurav Maheswari, N. Sadagopan
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs i…