Search Results for ""

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

The distance from the center of a circle to its perimeter, or from the center of a sphere to its surface. The radius is equal to half the diameter.

A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.

The perpendicular distance h from an arc's midpoint to the chord across it, equal to the radius R minus the apothem r, h=R-r. (1) For a regular polygon of side length a, h = ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

Differential Geometry

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...