Dergiler / Journal of Algebra Combinatorics Discrete Structures and Applications / 2017 / Cilt: 4 - Sayı: 1

On the matching polynomial of hypergraphs

On the matching polynomial of hypergraphs

Zhiwei GUO, Haixing ZHAO, Yaping MAO

Sayfa
1–11
DOI
—

Abstract

The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received considerable attention and research. In this paper, we generalize this concept and introduce the matching polynomial of hypergraphs. A recurrence relation of the matching polynomial of a hypergraph is obtained. The exact matching polynomials of some special hypergraphs are given. Further, we discuss the zeros of matching polynomials of hypergraphs.