5 citations · 8 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2016
Constrained Hitting Set and Steiner Tree in and -free Graphs
S. Dhanalakshmi, N. Sadagopan
\emph{Strictly Chordality- graphs ()} are graphs which are either cycle-free or every induced cycle is of length exactly . Strictly chordality-3 and strictly…
math.CO2016★ 5 cited
On 2K2-free graphs - Structural and Combinatorial View
S. Dhanalakshmi, N. Sadagopan, V. Manogna
A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex…
math.CO2016★ 1 cited
Tri-connectivity Augmentation in Trees
S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar
For a connected graph, a {\em minimum vertex separator} is a minimum set of vertices whose removal creates at least two connected components. The vertex connectivity of the graph r…