On star polynomials, graphical partitions and reconstruction (Q921015)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On star polynomials, graphical partitions and reconstruction |
scientific article; zbMATH DE number 4164902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On star polynomials, graphical partitions and reconstruction |
scientific article; zbMATH DE number 4164902 |
Statements
On star polynomials, graphical partitions and reconstruction (English)
0 references
1988
0 references
Summary: 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.
0 references
star cover
0 references
graphical partition
0 references
reconstruction
0 references
star polynomial
0 references
