55 citations · 628 across the 77 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 1 cited
On a connection between the switching separability of a graph and that of its subgraphs
Denis Krotov
A graph of order is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent s…
math.CO2011★ 8 cited
Poly-Bernoulli numbers and lonesum matrices
Hyun Kwang Kim, Denis S. Krotov, Joon Yop Lee
A lonesum matrix is a matrix that can be uniquely reconstructed from its row and column sums. Kaneko defined the poly-Bernoulli numbers by a generating function, and Br…