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:
“What do we want with this vast and worthless area, of this region of savages and wild beasts, of deserts, of shifting sands and whirlwinds, of dust, of cactus and prairie dogs; to what use could we ever hope to put these great deserts, or those endless mountain ranges, impenetrable and covered to their very base with eternal snow? What can we ever hope to do with the western coast, a coast of 3,000 miles, rockbound, cheerless, uninviting and not a harbor in it?”
—For the State of Kansas, U.S. public relief program (1935-1943)
“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)