how to create hop-constrained minimum spanning tree?

I want to create hop-constrained minimum spanning tree. the resulted answer must not have a cycle, or dose not exceed H (hop-constrained) and and must be minimum as well. the input is a graph. so the input is an nxn matrix.

i just know that i have to use Kruskall or Prime algorithm to create spanning tree from that graph. but i dont have any idea about hop-constrained (????). and then i will use an optimization method to improve the answer. i dont know how to implement it in matlab.