A cost allocation rule for kk-hop minimum cost spanning tree problems

In this note, we prove that the core of a kk-hop minimum cost spanning tree problem could be empty. We also introduce a cost sharing rule based on bankruptcy problems. We prove that this rule satisfies meaningful properties for these problems.