\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (Q479049): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2014.10.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2014.10.008 / rank | |||
Normal rank | |||
Latest revision as of 18:42, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs |
scientific article |
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
