Matching polynomial;
Edge cut;
The largest matching root;
Combinatorial problems;
POLYNOMIALS;
D O I:
10.1016/j.ipl.2018.02.002
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this note we study the largest matching roots of matching polynomials of graphs under two grapht transformations. As an application we show that K-n(k) is the graph which has the maximal largest matching root among the graphs with n vertices and k cut edges. (C) 2018 Published by Elsevier B.V.