Graph Theory With Applications
Graph Theory With Applications
Hi-index | 0.00 |
To discuss the matching uniqueness of the simple undirected graph G. To find the necessary and sufficient conditions for the matching uniqueness of T(a,b,c). Use the maximum real roots, and the properties of matching polynomials to compute. For n≥5, T(1,5,n) and its complement are matching uniqueness if and only if n≠5,8 and 15.