Computing closeness for some graphs (Q6152844)
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 7804163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing closeness for some graphs |
scientific article; zbMATH DE number 7804163 |
Statements
Computing closeness for some graphs (English)
0 references
13 February 2024
0 references
graph vulnerability
0 references
closeness
0 references
Mycielski graph
0 references
tadpole graph
0 references
