On the number of leaves of a Euclidean minimal spanning tree.
01 January 1987
Let V sub (k,n) be the number of vertices of degree k in the Euclidean minimal spanning tree of X sub i, 1
-
Industries
IndustriesTrusted networks with superior performance to meet the demands and opportunities of your digital transformation.
-
Network solutions
Network solutionsNetworks with superior performance, and security. Now you can reduce operational complexity and ensure resilience across your operations. Enrich your customers' experience, create new value and expand your opportunities.
-
Insights and innovation
Insights and innovationGet expert insights so you can break down the barriers that are holding you back.
-
Collaborate with us
-
We are Nokia
We are NokiaWe are a B2B technology innovation leader in networking, bringing together the world's people, machines and devices to realize the potential of digital in every industry.
Select your country
We have limited content available for some countries. Find office information and country specific information through our country hub.