Dyck graph

A Dyck graph is a type of graph that represents the relationships between different valid sequences of balanced parentheses or paths in a lattice. The concept is often tied to combinatorial structures and is particularly connected to Dyck words, which are sequences of symbols that maintain a balance (for every opening symbol, there is a corresponding closing symbol).