Some general classes of comatching graphs

E. J. Farrell and S. A. Wahid

International Journal of Mathematics and Mathematical Sciences, 1987, vol. 10, 1-6

Abstract:

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.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/10/579325.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/10/579325.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:579325

DOI: 10.1155/S0161171287000619

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 ().