science

Parity graph

Parity graph is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Parity graph rather than just read about it. In short: 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).

Key takeaways

Parity graph belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Parity graph to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Parity graph from memory before moving on to harder problems.

Reference excerpt

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).

Related classes of graphs Parity graphs include the distance-hereditary graphs, in which every two induced paths between the same two vertices have the same length. They also include the bipartite graphs, which may be characterized analogously as the graphs in which every two paths (not necessarily induced paths) between the same two vertices have the same parity, and the line perfect graphs, a generalization of the bipartite graphs. Every parity graph is a Meyniel graph, a graph in which every odd cycle of length five or more has two chords. For, in a parity graph, any long odd cycle can be partitioned into two paths of different parities, neither of which is a single edge, and at least one chord is needed to prevent these from both being induced paths. Then, partitioning the cycle into two paths between the endpoints of this first chord, a second chord is needed to prevent the two paths of this second partition from being induced. Because Meyniel graphs are perfect graphs, parity graphs are also perfect. They are exactly the graphs whose Cartesian product with a single edge remains perfect.

Algorithms A graph is a parity graph if and only if every component of its split decomposition is either a complete graph or a bipartite graph. Based on this characterization, it is possible to test whether a given graph is a parity graph in linear time. The same characterization also leads to generalizations of some graph optimization algorithms from bipartite graphs to parity graphs. For instance, using the split decomposition, it is possible to find the weighted maximum independent set of a parity graph in polynomial time.

References

Illustrations

Worked examples

Example 1 — a first encounter with Parity graph

Start with the simplest possible case. Write down what Parity graph claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Parity graph before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Parity graph ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Parity graph

In research: Parity graph appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Parity graph in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Parity graph is common in secondary-school and first-year university syllabi. It links to neighbouring topics Graph families, Perfect graphs, so understanding it makes those chapters shorter.
In everyday life: Look for Parity graph outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Parity graph in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Parity graph means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Parity graph out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Parity graph in simple terms?

Why does Parity graph matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Parity graph?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Parity graph.