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 |
connected graph
Author: Marian Olejar, Jr. Created: May/15/2006 Last edit: Nov/14/2006
graph theory:
A non-empty graph G is called connected graph if any two of its vertices are linked by path in G. If graph is not connected graph, it is called disconnected graph. See also: empty graph, k connected graph, Cite this article as: Marian Olejar, Jr.: connected graph from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/connected_graph.php |