A note on the vertex-switching reconstruction
Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the vertex switching are given. It is also shown that any disconnected graph with at least five vertices is reconstructible.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1988-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171288001012 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|