Minimum identifying codes in some graphs differing by matchings (Q4965914)
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 7324425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum identifying codes in some graphs differing by matchings |
scientific article; zbMATH DE number 7324425 |
Statements
Minimum identifying codes in some graphs differing by matchings (English)
0 references
18 March 2021
0 references
identifying code
0 references
complete bipartite graph
0 references
path
0 references
cycle
0 references
0.8649314045906067
0 references
0.8272266983985901
0 references
0.8176483511924744
0 references
0.8156415224075317
0 references
0.8092941045761108
0 references
