Computing closeness for some graphs (Q6152844): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2478/ausi-2023-0015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4389617128 / rank | |||
Normal rank | |||
Revision as of 10:26, 30 July 2024
scientific article; zbMATH DE number 7804163
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
