Some general classes of comatching graphs
Some sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1987-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171287000619 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563354270433280 |
|---|---|
| author | E. J. Farrell S. A. Wahid |
| author_facet | E. J. Farrell S. A. Wahid |
| author_sort | E. J. Farrell |
| collection | DOAJ |
| description | Some sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs. |
| format | Article |
| id | doaj-art-3d80a5b6e5b64993a7eec9451b215d85 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1987-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-3d80a5b6e5b64993a7eec9451b215d852025-02-03T01:20:18ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251987-01-0110351952410.1155/S0161171287000619Some general classes of comatching graphsE. J. Farrell0S. A. Wahid1Department of Mathematics, The University of the West Indies, St. Augustine, Trinidad and TobagoDepartment of Mathematics, The University of the West Indies, St. Augustine, Trinidad and TobagoSome sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs.http://dx.doi.org/10.1155/S0161171287000619matching polynomialcomatching graphsweightchainscyclesattaching graphs to other graphs. |
| spellingShingle | E. J. Farrell S. A. Wahid Some general classes of comatching graphs International Journal of Mathematics and Mathematical Sciences matching polynomial comatching graphs weight chains cycles attaching graphs to other graphs. |
| title | Some general classes of comatching graphs |
| title_full | Some general classes of comatching graphs |
| title_fullStr | Some general classes of comatching graphs |
| title_full_unstemmed | Some general classes of comatching graphs |
| title_short | Some general classes of comatching graphs |
| title_sort | some general classes of comatching graphs |
| topic | matching polynomial comatching graphs weight chains cycles attaching graphs to other graphs. |
| url | http://dx.doi.org/10.1155/S0161171287000619 |
| work_keys_str_mv | AT ejfarrell somegeneralclassesofcomatchinggraphs AT sawahid somegeneralclassesofcomatchinggraphs |