10 citations · 11 across the 5 of their papers we have counts for
5 papers · 1 filter
Algorithm for -partitions, parameterized complexity of the matrix determinant and permanent
Ranveer Singh, Vivek Vijay, RB Bapat
Every square matrix can be represented as a digraph having vertices. In the digraph, a block (or 2-connected component) is a maximally c…
Linear time algorithm to check the singularity of block graphs
Ranveer Singh, Naomi Shaked-Monderer, Avi Berman
A block graph is a graph in which every block is a complete graph. Let be a block graph and let be its (0,1)-adjacency matrix. Graph is called nonsingular (singular)…
On the classical dynamics of charged particle in special class of spatially non-uniform magnetic field
Ranveer Kumar Singh
Motion of a charged particle in uniform magnetic field has been studied in detail, classically as well as quantum mechanically. However, classical dynamics of a charged particle in…
Rank of weighted digraphs with blocks
Ranveer Singh, Swarup Kumar Panda, Naomi Shaked-Monderer +1
Let be a digraph and be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digr…
Nonsingular Block Graphs: An Open Problem
Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer +1
A block graph is a graph in which every block is a complete graph. Let be a block graph and let be its (0,1)-adjacency matrix. Graph is called nonsingular (singular)…