|
|
|
|
On the matching polynomial of hypergraphs
|
|
|
|
|
|
|
|
نویسنده
|
guo zhiwei ,zhao haixing ,mao yaping
|
|
منبع
|
journal of algebra combinatorics discrete structures and applications - 2017 - دوره : 4 - شماره : 1 - صفحه:1 -11
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Hypergraph ,Matching polynomial ,Line-graph ,Independence polynomial
|
|
آدرس
|
qinghai normal university, department of mathematics, china, qinghai normal university, school of computer, china, qinghai normal university, department of mathematics, China
|
|
پست الکترونیکی
|
maoyaping@ymail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|