Hitesh Wankhede

activity

20212024

most citedOn the construction of cospectral nonisomorphic bipartite graphs

5 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Computing the permanental polynomial of $4 k$ -intercyclic bipartite graphs

Ravindra B. Bapat, Ranveer Singh, Hitesh Wankhede

Let $G$ be a bipartite graph with adjacency matrix $A (G)$ . The characteristic polynomial $ϕ (G, x) = det (x I - A (G))$ and the permanental polynomial $π (G, x) = per (x I - A (G))$ are bo…

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…

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

Constructing cospectral graphs by unfolding non-bipartite graphs

Computing the permanental polynomial of $4 k$ -intercyclic bipartite graphs