5 citations · 5 across the 4 of their papers we have counts for
4 papers
Computing the permanental polynomial of -intercyclic bipartite graphs
Ravindra B. Bapat, Ranveer Singh, Hitesh Wankhede
Let be a bipartite graph with adjacency matrix . The characteristic polynomial and the permanental polynomial are bo…
Constructing cospectral graphs by unfolding non-bipartite graphs
M. Rajesh Kannan, Shivaramakrishna Pragada, Hitesh Wankhede
In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrice…
A note on graphs with purely imaginary per-spectrum
Ranveer Singh, Hitesh Wankhede
In 1983, Borowiecki and Jóźwiak posed the problem ``Characterize those graphs which have purely imaginary per-spectrum.'' This problem is still open. The most general result, altho…
On the construction of cospectral nonisomorphic bipartite graphs
M. Rajesh Kannan, Shivaramakrishna Pragada, Hitesh Wankhede
In this article, we construct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices using partitioned tensor product. This extends the cons…