Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,351,008 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
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
2017
2017
Matching polynomial tails to the cut-off Woods-Saxon potential
Á. Baran
,
T. Vertse
2017
Corpus ID: 119242943
Cutting off the tail of the Woods-Saxon and generalized Woods-Saxon potentials changes the distribution of the poles of the $S…
Expand
2016
2016
The minimum matching energy of bicyclic graphs with given girth
Honghai Li
,
Lian Zou
2016
Corpus ID: 32644570
The matching energy of a graph was introduced by Gutman and Wagner in 2012 and defined as the sum of the absolute values of zeros…
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
2014
2014
The Secret sharing scheme based on acyclic polynomial sequence
Lian-cheng Bi
2014
Corpus ID: 124690999
The author introduces the concept of polynomial sequence.Some properties about the polynomial sequence which constant term is one…
Expand
2007
2007
FPRAS for computing a lower bound for weighted matching polynomial of graphs
S. Friedland
arXiv.org
2007
Corpus ID: 996315
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted…
Expand
1995
1995
A Unified Approach to the First Derivatives of Graph Polynomials
Xueliang Li
,
I. Gutman
Discrete Applied Mathematics
1995
Corpus ID: 24067208
1987
1987
On the reconstraction of the matching polynomial and the reconstruction conjecture
E. Farrell
,
S. Wahid
1987
Corpus ID: 40093724
Two results are proved. (i) It is shown that the matching polynomial is both node and edge reconstructable. Moreover a practical…
Expand
1985
1985
A note on the matching numbers of triangle-free graphs
R. Frucht
,
Reinaldo E. Giudici
Journal of Graph Theory
1985
Corpus ID: 27730367
For the sake of brevity the absolute values of the coefficients of the matching polynomial of a graph are called matching numbers…
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