File:Path.png
From Scholarpedia
No higher resolution available.
Path.png (494 × 115 pixels, file size: 12 KB, MIME type: image/png)
Summary
The path graph of size 6, P_6. R={1} is a minimal resolving set of this graph. In general, any set of the form {v}, with v a node of degree 1 in P_n, is a minimal resolving set on P_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 | | 494 × 115 (12 KB) | Richard Carter Tillquist (Talk | contribs) | The path graph of size 6, <math>P_6</math>. <math>R = \{1\}</math> is a minimal resolving set of this graph. In general, any set of the form <math>\{v\}</math>, with <math>v</math> a node of degree 1 in <math>P_n</math>, is a minimal resolving set on <... |
| 22:31, 5 August 2019 |  | 571 × 416 (15 KB) | Richard Carter Tillquist (Talk | contribs) | The path graph of size 6, P_6. R={1} is a minimal resolving set of this graph. In general, any set of the form {v}, with v a node of degree 1 in P_n, is a minimal resolving set on P_n. |
- Edit this file using an external application (See the setup instructions for more information)
File usage
The following page links to this file:
