File:Complete.png
From Scholarpedia
No higher resolution available.
Complete.png (508 × 376 pixels, file size: 22 KB, MIME type: image/png)
Summary
The complete graph of size 4, K_4. R={1,2,3} is a minimal resolving set of this graph. In general, any set of nodes of cardinality (n−1) is a minimal resolving set of K_n.
Licensing
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 18:23, 6 August 2019 | | 508 × 376 (22 KB) | Richard Carter Tillquist (Talk | contribs) | The complete graph of size 4, <math>K_4</math>. <math>R = \{1, 2, 3\}</math> is a minimal resolving set of this graph. In general, any set of nodes of cardinality <math>(n-1)</math> is a minimal resolving set of <math>K_n</math>. |
| 22:33, 5 August 2019 |  | 874 × 648 (28 KB) | Richard Carter Tillquist (Talk | contribs) | The complete graph of size 4, K_4. R={1,2,3} is a minimal resolving set of this graph. In general, any set of nodes of cardinality (n−1) is a minimal resolving set of K_n. |
- Edit this file using an external application (See the setup instructions for more information)
File usage
The following page links to this file:
