Computing the Permanental Polynomial of 4k-Intercyclic Bipartite Graphs: A Combinatorial Approach

This research paper presents a novel combinatorial method for computing the permanental polynomial of 4k-intercyclic bipartite graphs, expanding the class of graphs for which this computation is feasible.