The Length of the Shortest Edge of a Graph on a Sphere

Author： Maehara H.  

Publisher： Academic Press

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.23, Iss.6, 2002-08, pp. : 713-717

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Length of a Shortest Closed Geodesic on a Two-Dimensional Sphere and Coverings by Metric Balls

By Rotman R.  

Geometriae Dedicata, Vol. 110, Iss. 1, 2005-02 ,pp. : 143-157

Springer Publishing Company

Access to resources Recommend Favorite

Stability of the 8-tetrahedra shortest-interior-edge partitioning method

By Kröger Tim   Preusser Tobias  

Numerische Mathematik, Vol. 109, Iss. 3, 2008-05 ,pp. : 435-457

Springer Publishing Company

Access to resources Recommend Favorite

The Invariance Principle for the Total Length of the Nearest-Neighbor Graph

By Kim Younghoon   Lee Sungchul   Lin Zhengyan   Wang Wensheng  

Journal of Theoretical Probability, Vol. 18, Iss. 3, 2005-07 ,pp. : 649-664

Springer Publishing Company

Access to resources Recommend Favorite

Per-spectral characterizations of some edge-deleted subgraphs of a complete graph

By Zhang Heping   Wu Tingzeng   Lai Hong-Jian  

Linear and Multilinear Algebra, Vol. 63, Iss. 2, 2015-02 ,pp. : 397-410

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Law of the Iterated Logarithm for the Total Length of the Nearest Neighbor Graph

By Kim Younghoon   Lee Sungchul   Lin Zhengyan  

Journal of Theoretical Probability, Vol. 17, Iss. 1, 2004-01 ,pp. : 245-260

Springer Publishing Company

Access to resources Recommend Favorite