This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. Permission MUST be requested prior to use.
(c) Marian Olejar, Jr., 2005-2007
|
Mathematical Search Engine |
|
|
topic index: Complex Analysis Graph Theory Number Theory Plane Geometry Solid Geometry Statistics Topology locations: dictionary help with math text search |
radius of graph
Author: Marian Olejar, Jr. Created: May/11/2006 Last edit: May/11/2006
graph theory:
Radius of graph G = (V, E) is the greatest distance from central vertex to any other vertex in G. Denoted by rad(G). relation between diameter and radius: rad(G) `<=` diam(G) `<=` 2rad(G) relation between radius, minimum degree and maximum degree: rad(G) = `min_(x in V(G)) max_(y in V(G)) d_G(x,y)` See also: girth, Cite this article as: Marian Olejar, Jr.: radius of graph from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/radius_of_graph.php |