An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement (Q1661501)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement |
scientific article |
Statements
An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement (English)
0 references
16 August 2018
0 references
