Distribution of zeros of matching polynomials of hypergraphs

Abstract: Let

h

be a connected

k

-graph with maximum degree

D e l t a g e q 2

and let

m u (h, x)

be the matching polynomial of

h

. In this paper, we devote to studying the distribution of zeros of the matching polynomials of

k

-graphs. We prove that the zeros (with multiplicities) of

m u (h, x)

are invariant under a rotation of an angle

2 p i / e l l

in the complex plane for some positive integer

e l l

and

k

is the maximum integer with this property. Let

l a m b d a (h)

denote the maximum modulus of all zeros of

m u (h, x)

. We show that

l a m b d a (h)

is a simple root of

m u (h, x)

and

Delta^{1over k} leq lambda(h)< frac{k}{k-1}((k-1)(Delta-1))^{1over k}.

To achieve these, we introduce the path tree

T (h, u)

of

h

with respect to a vertex

u

of

h

, which is a

k

-tree, and prove that

frac{mu(h-u,x)}{mu(h, x)} = frac{mu(T(h,u)-u,x) }{mu(T(h,u),x)},

which generalizes the Godsil's identity ({em Matchings and walks in graphs. J. Graph Theory} 5 (1981) 285--297) on the matching polynomial of graphs.

This page was built for publication: Distribution of zeros of matching polynomials of hypergraphs