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

TL;DR

This work provides an expression for \(\pi(G,x) in terms of the modified characteristic polynomial of the graph and its subgraphs" in terms of the Pfaffian orientation method found in the literature to compute the permanental polynomial.

Abstract

Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $φ(G,x)=\det(xI-A(G))$ and the permanental polynomial $π(G,x) = \text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For bipartite graphs, we define the modified characteristic polynomial, which is obtained by changing the signs of some of the coefficients of $φ(G,x)$. For $4k$-intercyclic bipartite graphs, i.e., those for which the removal of any $4k$-cycle results in a $C_{4k}$-free graph, we provide an expression for $π(G,x)$ in terms of the modified characteristic polynomial of the graph and its subgraphs. Our approach is purely combinatorial in contrast to the Pfaffian orientation method found in the literature to compute the permanental polynomial.

Figures (1)

• Figure 1: Example of a $4k$-intercyclic bipartite graph.

Theorems & Definitions (16)

• Proposition 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Theorem 1.5
• proof
• Theorem 1.6
• Theorem 2.1
• Lemma 2.2
• proof : Proof of Lemma \ref{['lem:fgx']}