3 papers
math.CO2024
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…
math.CO2024
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…
math.CO2024
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, alt…