\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (Q479049)
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: k-restricted edge connectivity in (p+1)-clique-free graphs |
scientific article; zbMATH DE number 6377059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs |
scientific article; zbMATH DE number 6377059 |
Statements
\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (English)
0 references
5 December 2014
0 references
interconnection network
0 references
restricted edge connectivity
0 references
clique
0 references
0 references
0 references
0 references
0.8568300008773804
0 references
0.845314085483551
0 references
0.8451023697853088
0 references
0.8376534581184387
0 references
0.8339553475379944
0 references
