Journal Menu

Abstracting and Indexing
Aims and Scope
Article Processing Charges
Author Guidelines
Bibliographic Information
Contact Information
Editorial Board
Editorial Workflow
Reviewers Acknowledgment
Subscription Information

Abstract
Full-Text PDF
How to Cite this Article

International Journal of Mathematics and Mathematical Sciences 
Volume 11 (1988), Issue 1, Pages 87-93
doi:10.1155/S0161171288000134

On star polynomials, graphical partitions and reconstruction

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

Department of Mathematics, University of West Indies, St. Augustine, Trinidad and Tobago

Received 29 April 1986

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.