当前位置: X-MOL 学术J. Algebraic Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Laplacian matching polynomial of graphs
Journal of Algebraic Combinatorics ( IF 0.6 ) Pub Date : 2019-06-06 , DOI: 10.1007/s10801-019-00892-9
A. Mohammadian

In this article, we introduce the Laplacian matching polynomial of a graph. We prove some results concerning this new polynomial which can be viewed as analogue results on the classical matching polynomial.

中文翻译:

图的拉普拉斯匹配多项式

在本文中,我们介绍了图的拉普拉斯匹配多项式。我们证明了有关这个新多项式的一些结果,这些结果可以看作是经典匹配多项式上的模拟结果。
更新日期:2019-06-06
down
wechat
bug