$mathcal{B}$-Partitions, determinant and permanent of graphs
Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,hdots,B_k$. A $mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(hat{B_1},hat{B_1},hdots,hat{B_k})$ such that $hat{B}_i$ is an induced subgraph of $B_i$ for $i=1,2,hdots,k.$ The ter...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2018-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_22426_684cba1ff8383118f056e8041a6e743a.pdf |