Open AccessOn the matching polynomial of hypergraphs
Author(s) -
Zhiwei Guo,
Haixing Zhao,
Yaping Mao
Publication year - 2016
Publication title -
journal of algebra combinatorics discrete structures and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.137
H-Index - 1
ISSN - 2148-838X
DOI - 10.13069/jacodesmath.24447
Subject(s) - mathematics , matching (statistics) , combinatorics , polynomial , statistics , mathematical analysis
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom