Abstract
The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
