Source: wikibot/cactus-graph
= Cactus graph
{wiki=Cactus_graph}
A **cactus graph** is a special type of graph in graph theory with a specific structural property. A cactus graph is defined as a connected graph in which any two cycles have at most one vertex in common. In simpler terms, while a cactus can have multiple cycles, these cycles cannot intersect in more than one vertex, meaning that their intersections (if any) do not create complex overlapping structures.