A new expression for matching polynomials

Let G be an arbitrary simple graph. Godsil and Gutman in 1978 and Yan et al. in 2005 established different expressions for the matching polynomial μ ( G , x ) in terms of det ( x I n − H ) for some families of matrices H . This paper improves their results and simplifies the computation of μ ( G , x...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 312; no. 4; pp. 803 - 807
Main Author Dong, F.M.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 28.02.2012
Subjects
Computation
Graph
Graphs
Matching
Matching polynomial
Mathematical analysis
Mathematical models
Matrices
Matrix
Matrix methods
Matching
Graph
Matrix
Matching polynomial
Online AccessGet full text

Cover

More Information
Summary:Let G be an arbitrary simple graph. Godsil and Gutman in 1978 and Yan et al. in 2005 established different expressions for the matching polynomial μ ( G , x ) in terms of det ( x I n − H ) for some families of matrices H . This paper improves their results and simplifies the computation of μ ( G , x ) .
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2011.11.019