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!
|
| _version_ | 1832562455763484672 |
|---|---|
| author | E. J. Farrell C. M. de Matas |
| author_facet | E. J. Farrell C. M. de Matas |
| author_sort | E. J. Farrell |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-3064ed19803f44aebf5454f53ba4e3ad |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1988-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-3064ed19803f44aebf5454f53ba4e3ad2025-02-03T01:22:34ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251988-01-01111879310.1155/S0161171288000134On star polynomials, graphical partitions and reconstructionE. J. Farrell0C. M. de Matas1Department of Mathematics, University of West Indies, St. Augustine, Trinidad and TobagoDepartment of Mathematics, University of West Indies, St. Augustine, Trinidad and TobagoIt 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.http://dx.doi.org/10.1155/S0161171288000134starstar polynomialstar covergraphical partitionreconstruction. |
| spellingShingle | E. J. Farrell C. M. de Matas On star polynomials, graphical partitions and reconstruction International Journal of Mathematics and Mathematical Sciences star star polynomial star cover graphical partition reconstruction. |
| title | On star polynomials, graphical partitions and reconstruction |
| title_full | On star polynomials, graphical partitions and reconstruction |
| title_fullStr | On star polynomials, graphical partitions and reconstruction |
| title_full_unstemmed | On star polynomials, graphical partitions and reconstruction |
| title_short | On star polynomials, graphical partitions and reconstruction |
| title_sort | on star polynomials graphical partitions and reconstruction |
| topic | star star polynomial star cover graphical partition reconstruction. |
| url | http://dx.doi.org/10.1155/S0161171288000134 |
| work_keys_str_mv | AT ejfarrell onstarpolynomialsgraphicalpartitionsandreconstruction AT cmdematas onstarpolynomialsgraphicalpartitionsandreconstruction |