Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,138,308 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Broader (1)
Algebraic graph theory
Characteristic polynomial
Clique-width
Cycle (graph theory)
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the minimal matching energies of unicyclic graphs
Jianming Zhu
,
Ju Yang
Discrete Applied Mathematics
2019
Corpus ID: 125184305
2018
2018
Unimodality of independence polynomials of the incidence product of graphs
Bao-Xuan Zhu
Discrete Mathematics
2018
Corpus ID: 49242592
2018
2018
Event-Triggered Polynomial Fuzzy Controller for Networked Polynomial Fuzzy Systems
Guiling Li
,
Chen Peng
International Conference on Cloud Computing and…
2018
Corpus ID: 117732543
This paper deals with the polynomial event-triggered control for nonlinear networked control systems (NCSs). Representing the…
Expand
2017
2017
Ordering of bicyclic graphs by matching energy
Xiangxiang Liu
,
Ligong Wang
,
Peng Xiao
2017
Corpus ID: 119299042
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…
Expand
2015
2015
Matrices of graphs and designs with emphasis on their integral eigen-pair balance characteristic.
Carol Lynne Jessop
2015
Corpus ID: 117518394
The interplay between graphs and designs is well researched. In this dissertation we connect designs and graphs entirely through…
Expand
2015
2015
Squares and primitivity in partial words
F. Blanchet-Sadri
,
M. Bodnar
,
J. Nikkel
,
J. Quigley
,
Xufan Zhang
Discrete Applied Mathematics
2015
Corpus ID: 14264158
2008
2008
Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover
C. Y. Ku
,
K. B. Wong
Electronic Journal of Combinatorics
2008
Corpus ID: 9071461
We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be…
Expand
2007
2007
The Complexity of Multivariate Matching Polynomials
Ilia Averbouch
2007
Corpus ID: 9689249
We study various versions of the univariate and multivariate matching and rook polynomials. We show that there is most general…
Expand
1995
1995
A Unified Approach to the First Derivatives of Graph Polynomials
Xueliang Li
,
I. Gutman
Discrete Applied Mathematics
1995
Corpus ID: 24067208
1993
1993
Reducing Matching to Polynomial Size Linear Programming
F. Barahona
SIAM Journal on Optimization
1993
Corpus ID: 207057777
The question of whether the maximum weight matching problem can be reduced to a linear program of polynomial size is studied. A…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE