File:Graph toughness.svg
Size of this PNG preview of this SVG file: 279 × 227 pixels. Other resolutions: 295 × 240 pixels | 590 × 480 pixels | 944 × 768 pixels | 1,259 × 1,024 pixels | 2,517 × 2,048 pixels.
Original file (SVG file, nominally 279 × 227 pixels, file size: 3 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: In this graph, removing the four red vertices would produce four connected components. However, there is no set of k vertices whose removal leaves more than k components. Therefore, its toughness is exactly 1. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 21:43, 31 January 2011 | | 279 × 227 (3 KB) | David Eppstein | {{Information |Description={{en|1=In this graph, removing the four red vertices would produce four connected components. However, there is no set of ''k'' vertices whose removal leaves more than ''k'' components. Therefore, its [[:en:Graph toughness|tough |
File usage
The following page uses this file:
Global file usage
The following other wikis use this file:
- Usage on fr.wikipedia.org
- Usage on hu.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on www.wikidata.org
