This paper puts forward the concept of kth minimum spanning trees.For the special case k= 2, an polynomial algorithm is given, whose time com-plexity is O(rnn),
The form of utility functions that have most extensive uses depends ondistinct positive real solutions of nonlinear equations which are constructed bythe sum po
In this paper, a kind of inverse eigenvalue problem which is the recon-struction of real symmetric five-diagonal matrix by three eigenvalues and corre-sponding