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:
“This is the dead land
This is cactus land
Here the stone images
Are raised, here they receive
The supplication of a dead man’s hand
Under the twinkle of a fading star.”
—T.S. (Thomas Stearns)
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)