$\mathcal{B}$-partitions, application to determinant and permanent of graphs

Ranveer Singh, R. B. Bapat

Let $G$ be a graph(directed or undirected) having $k$ number of blocks. A $\mathcal{B}$-partition of $G$ is a partition into $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdo…