A sufficient condition for graphs to be super \(k\)-restricted edge connected (Q2364076)
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: A sufficient condition for graphs to be super k-restricted edge connected |
scientific article; zbMATH DE number 6747765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for graphs to be super \(k\)-restricted edge connected |
scientific article; zbMATH DE number 6747765 |
Statements
A sufficient condition for graphs to be super \(k\)-restricted edge connected (English)
0 references
17 July 2017
0 references
neighborhood
0 references
\(k\)-restricted edge connectivity
0 references
super \(k\)-restricted edge connected graph
0 references
0 references
0 references
0.9324130415916444
0 references
0.9132523536682128
0 references
0.9064093232154846
0 references
0.9052490592002868
0 references
0.9048158526420592
0 references
