Strongly \(n\)-e.c. graphs and independent distinguishing labellings (Q6154909)
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 7805856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly \(n\)-e.c. graphs and independent distinguishing labellings |
scientific article; zbMATH DE number 7805856 |
Statements
Strongly \(n\)-e.c. graphs and independent distinguishing labellings (English)
0 references
16 February 2024
0 references
graph evolution
0 references
\(n\)-ordered graphs
0 references
graph distinguishing
0 references
0.7482846975326538
0 references
0.7418251633644104
0 references
0.737250030040741
0 references
0.7176700830459595
0 references
0.7130927443504333
0 references
