Sufficient conditions for a graph to be super restricted edge-connected (Q3507650)
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 5291358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for a graph to be super restricted edge-connected |
scientific article; zbMATH DE number 5291358 |
Statements
Sufficient conditions for a graph to be super restricted edge-connected (English)
0 references
20 June 2008
0 references
restricted edge connectivity
0 references
super restricted edge-connected graphs
0 references
diameter
0 references
girth
0 references
0.9182778000831604
0 references
0.9125903844833374
0 references
0.8993607759475708
0 references
0.8879653811454773
0 references
0.8827428817749023
0 references
