Search Results for ""

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

The diameter of a circle is the distance from a point on the circle to a point pi radians away, and is the maximum distance from one point on a circle to another. The ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

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 ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

The line segment KO^_ joining the symmedian point K and circumcenter O of a given triangle. It is the diameter of the triangle's Brocard circle, and lies along the Brocard ...

Let phi(z)=cz+c_0+c_1z^(-1)+c_2z^(-2)+... be an analytic function, regular and univalent for |z|>1, that maps |z|>1 conformally onto the region T preserving the point at ...

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...