The higher-order matching polynomial of a graph

Oswaldo Araujo, Mario Estrada, Daniel A. Morales and Juan Rada

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-12

Abstract:

Given a graph G with n vertices, let p ( G , j ) denote the number of ways j mutually nonincident edges can be selected in G . The polynomial M ( x ) = ∑ j = 0 [ n / 2 ] ( − 1 ) j p ( G , j ) x n − 2 j , called the matching polynomial of G , is closely related to the Hosoya index introduced in applications in physics and chemistry. In this work we generalize this polynomial by introducing the number of disjoint paths of length t , denoted by p t ( G , j ) . We compare this higher-order matching polynomial with the usual one, establishing similarities and differences. Some interesting examples are given. Finally, connections between our generalized matching polynomial and hypergeometric functions are found.

Date: 2005
References: Add references at CitEc
Citations:

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

DOI: 10.1155/IJMMS.2005.1565

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