On the matching polynomial of hypergraphs

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Zhiwei Guo¹  Haixing Zhao¹  Yaping Mao² 

[1] Department of Mathematics, Qinghai Normal University;School of Computer, Qinghai Normal University

关键词: Hypergraph;    Matching polynomial;    Line-graph;    Independence polynomial;   

DOI  :  10.13069/jacodesmath.24447

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

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.

【 授权许可】

CC BY