Vertex distance is roughly defined as the distance between a person's glasses (spectacles) and their eyes. Moving the glasses closer or further from the eyes changes the optical properties of the system, including
Wikimedia Foundation. 2010.
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Distance (graph theory) — Geodesic distance redirects here. For distances on the surface of the Earth, see Great circle distance. In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path connecting… … Wikipedia
Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Distance à vol d'oiseau — Orthodromie Comparaison entre les routes loxodromique (rouge) et orthodromique (blanc) sur une carte à projection de Mercator L orthodromie désigne le chemin le plus court entre deux points d une sphère, c est à dire l arc de grand cercle qui… … Wikipédia en Français
Vertex arrangement — See vertex figure for the local description of faces around a vertex of a polyhedron or tiling. In geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in… … Wikipedia
Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group … Wikipedia
Resistance distance — In graph theory, the resistance distance between two vertices of a simple connected graph, G , is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G , with each edge being replaced … Wikipedia
Angular distance — Angular An gu*lar, a. [L. angularis, fr. angulus angle, corner. See {Angle}.] 1. Relating to an angle or to angles; having an angle or angles; forming an angle or corner; sharp cornered; pointed; as, an angular figure. [1913 Webster] 2. Measured… … The Collaborative International Dictionary of English
sitting vertex height — the distance from the highest point of the head in the sagittal plane to the surface on which the subject is seated; commonly called sitting h. Cf. crown rump length … Medical dictionary
