This paper investigates the minimum spanning tree problem in the framework of uncertainty theory, where the edge weights are assumed as uncertain variables. The concept of ideal uncertain minimum spanning tree is initiated by extending the definition of the uncertain α-minimum spanning tree. On the basis of this new concept, we propose the definition of uncertain distribution-minimum spanning t...

In this article, we provide a constructive procedure to generate a spanning tree for any graph from its dominating set, γ set. We introduce a new kind of minimum dominating set and hence generate a minimum weighted spanning tree from a γ set for G. We also provide a method for generating a minimum weighted spanning tree using adjacency matrix of G. Key–Words: Spanning tree, Minimum dominating s...

We study minimum cost spanning tree problems and de…ne a cost sharing rule that satis…es many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties. Keywords: Spanning tree. Cost allocation. Monotonicity. JEL Classi…cation Numbers: C71, D63, D7.

Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi, 1 < i n, where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n -Vkn converges with probability 1 to a constant ak,dIntermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted,...

In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to the source and dividing the cost amongst them. The basic idea is very simple: we ask each agent the part of the cost he is willing to pay for an arc to be constructed. We prove that there exists a unique payoff allocation associated with the subgame perfect Nash equilibria of th...

Two segmentation methods based on the minimum spanning tree principle are evaluated with respect to each other. The hierarchical minimum spanning tree method is also evaluated with respect to human segmentations. Discrepancy measure is used as best suited to compute the segmentation error between the methods. The evaluation is done using gray value images. It is shown that the segmentation resu...

0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.01.051 ⇑ Corresponding author. Tel.: +90 312 29

We investigated the network structures of the Japanese stock market through the minimum spanning tree. We defined grouping coefficient to test the validity of conventional grouping by industrial categories, and found a decreasing in trend for the coefficient. This phenomenon supports the increasing external influences on the market due to the globalization. To reduce this influence, we used S&P...