2 citations · 7 across the 10 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Algorithmic study of -transitivity of graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \emph{dominates} if every vertex…
math.CO2022★ 1 cited
Transitivity on subclasses of chordal graphs
Subhabrata Paul, Kamal Santra
Let be a graph, where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \textit{dominates} if every ver…