The matching polynomial of a distance-regular graph

Robert A. Beezer and E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 2000, vol. 23, 1-9

Abstract:

A distance-regular graph of diameter d has 2 d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from its intersection array, and that this is the maximum number of coefficients so determined. Also, the converse is true for distance-regular graphs of small diameter—that is, the intersection array of a distance-regular graph of diameter 3 or less can be determined from the matching polynomial of the graph.

Date: 2000
References: Add references at CitEc
Citations:

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

DOI: 10.1155/S0161171200000740

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