Note | Common Terminologies in Graph Thoery
Common Terminologies in Graph Thoery Define an undirected graph with the natrual order as $G = (V,E,\sigma)$ where $V$ is the set of the vertices, $E$ is the set of edges and $\sigma$ is the natrual ordering. Chordal graph A chordal is a path of undirected graph between two non-conescutive vertices. (“shortcut”" between two vertices") A chordal graph referes to every cycle of length four or greater of a simple graph has a chord. (triangulated graph) Chordal Completion ...