Skip to search formSkip to main contentSkip to account menu

Matching polynomial

Known as: Acyclic polynomial 
In the mathematical fields of graph theory and combinatorics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper deals with the polynomial event-triggered control for nonlinear networked control systems (NCSs). Representing the… 
2017
2017
Let $G$ be a simple graph of order $n$ and $\mu_{1},\mu_{2},\ldots,\mu_{n}$ be the roots of its matching polynomial. The matching… 
2015
2015
The interplay between graphs and designs is well researched. In this dissertation we connect designs and graphs entirely through… 
2008
2008
We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be… 
2007
2007
We study various versions of the univariate and multivariate matching and rook polynomials. We show that there is most general… 
1993
1993
The question of whether the maximum weight matching problem can be reduced to a linear program of polynomial size is studied. A…