The matching polynomial of a distance-regular graph

DOI10.1155/S0161171200000740zbMath0947.05063MaRDI QIDQ1975936

E. J. Farrell, Robert A. Beezer

Publication date: 8 May 2000

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48544

zbMATH Keywords

distance-regular graphdiametermatching polynomialintersection array

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the matching polynomial of subdivision graphs ⋮ On Weisfeiler-Leman invariance: subgraph counts and related graph properties

This page was built for publication: The matching polynomial of a distance-regular graph