On the matching polynomial of hypergraphs

Authors

  • Zhiwei Guo
  • Haixing Zhao
  • Yaping Mao

Keywords:

Hypergraph, Matching polynomial, Line-graph, Independence polynomial

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.

Downloads

Download data is not yet available.

Downloads

Published

2016-01-15

How to Cite

Guo, Z., Zhao, H., & Mao, Y. (2016). On the matching polynomial of hypergraphs. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(1), 1–11. Retrieved from https://jacodesmath.com/index.php/jacodesmath/article/view/51

Issue

Vol. 4 Issue 1: January 2017

Section

Articles

Most read articles by the same author(s)