On star polynomials, graphical partitions and reconstruction

E. J. Farrell and C. M. de Matas

International Journal of Mathematics and Mathematical Sciences, 1988, vol. 11, 1-7

Abstract:

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.

Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/11/102493.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/11/102493.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:102493

DOI: 10.1155/S0161171288000134

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().