2 citations · 3 across the 16 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
On the Complexity and Algorithms for the Upper Domatic Number of Graphs
Subhabrata Paul, Kamal Santra
Let \(G\) be a graph. For two disjoint vertex sets \(A,B\subseteq V(G)\), we say that \(A\) dominates \(B\) if every vertex of \(B\) has a neighbour in \(A\). An upper domatic part…
math.CO2024
Tournament transitivity of graphs
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 vert…