On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph (Q5080252)
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 7534217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph |
scientific article; zbMATH DE number 7534217 |
Statements
On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph (English)
0 references
31 May 2022
0 references
complex unit gain graph
0 references
characteristic polynomial
0 references
rank
0 references
matching number
0 references
cyclomatic number
0 references
0 references
0 references
0 references
0 references
0 references
0.9186564087867736
0 references
0.8993370532989502
0 references
0.8838118314743042
0 references
0.8605947494506836
0 references
0.8283524513244629
0 references
