The extremal graph of given the number of cut vertex having minimal EDS (Q4641328)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The extremal graph of given the number of cut vertex having minimal EDS |
scientific article; zbMATH DE number 6875109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The extremal graph of given the number of cut vertex having minimal EDS |
scientific article; zbMATH DE number 6875109 |
Statements
25 May 2018
0 references
distance
0 references
cut vertex
0 references
extremal graph
0 references
0.8338757753372192
0 references
0.8309289813041687
0 references
0.8063019514083862
0 references
