On star polynomials, graphical partitions and reconstruction
It is shown that the partition of a graph can be determined from its star polynomial and an algorithm is given for doing so. It is subsequently shown (as it is well known) that the partition of a graph is reconstructible from the set of node-deleted subgraphs.
Saved in:
| Main Authors: | , |
|---|---|
| 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/S0161171288000134 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|