Permanent, determinant, and rank of bi-block graphs (Q2297337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Permanent, determinant, and rank of bi-block graphs |
scientific article; zbMATH DE number 7169696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permanent, determinant, and rank of bi-block graphs |
scientific article; zbMATH DE number 7169696 |
Statements
Permanent, determinant, and rank of bi-block graphs (English)
0 references
18 February 2020
0 references
A graph is called a bi-block graph if each of its blocks (maximal 2-connected subgraphs) is a complete bipartite graph. This paper gives linear time algorithms for calculating the permanent, determinant and rank of the adjacency matrix of bi-block graphs.
0 references
permanent
0 references
deteminant
0 references
rank
0 references
bi-block
0 references
perfect matching
0 references
0.88294804
0 references
0.8767909
0 references
0 references
0.8737421
0 references
0 references
0.8703605
0 references
