Nearly all biregular graphs have degree associated edge reconstruction number at most three. (Q3382225)
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 7397961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly all biregular graphs have degree associated edge reconstruction number at most three. |
scientific article; zbMATH DE number 7397961 |
Statements
20 September 2021
0 references
reconstruction
0 references
reconstruction number
0 references
isomorphism
0 references
biregular graphs
0 references
0.8796521425247192
0 references
0.8792973756790161
0 references
0.8700001239776611
0 references
0.8529640436172485
0 references
