On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph (Q4580054)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6916840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph |
scientific article; zbMATH DE number 6916840 |
Statements
On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph (English)
0 references
13 August 2018
0 references
mixed graph
0 references
\(H\)-rank
0 references
lower-optimal
0 references
upper-optimal
0 references
0 references
0 references
0 references
0 references
0 references
0.95890075
0 references
0.9417143
0 references
0.8935064
0 references
0.8892709
0 references
0.8883521
0 references
0 references
0.88567597
0 references
0.8764874
0 references
0.87381774
0 references
