In graph theory, a parity graph is a graph in which all induced paths between the same two vertices have the same parity: either all paths have odd length, or all have even length. This class of graphs was named and first studied by Burlet & Uhry (1984).
In graph theory, a parity graph is a graph in which all induced paths between the same two vertices have the same parity: either all paths have odd length, or all have even length. This class of graphs was named and first studied by Burlet & Uhry (1984).
Source: Wikipedia "Parity graph" · CC BY-SA 4.0
Share this article: X · Bluesky