期刊名称:International Journal of Mathematics and Mathematical Sciences
印刷版ISSN:0161-1712
电子版ISSN:1687-0425
出版年度:1988
卷号:11
DOI:10.1155/S0161171288000134
出版社:Hindawi Publishing Corporation
摘要: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.