5 citations · 11 across the 8 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2016★ 2 cited
On strictly Chordality-k graphs
S. Dhanalakshmi, N. Sadagopan
Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are pre…
cs.DM2011
On the Complexity of Connected -Vertex Separator
N. S. Narayanaswamy, N. Sadagopan
We show that minimum connected -vertex separator (-CVS) is -hard for any unless NP has quasi-polynomial Las-Vegas algorithms. i.e., for any …
cs.DM2009
A Note on Contractible Edges in Chordal Graphs
N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a -connected graph is {\em contractib…