Cactus Graph
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge in such a graph belongs to at most one simple cycle. Equivalently, every block (maximal subgraph without a cut-vertex) is an edge or a cycle.
Read more about Cactus Graph: Properties, Algorithms and Applications, History
Famous quotes containing the words cactus and/or graph:
“My bones denounce the buckboard bounce and the cactus hurts my toes.”
—Ray Evans (b. 1915)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)