---
tag: 2QVEM9KHHK
kind: concept
name: Strongly chordal graph
sources:
  - wikipedia: en:24809733@r1369813176
    locator: Strongly chordal graph
    note: adopted
    mention: wikipedia://en/24809733
    sections: [Summary]
same_as:
  wikidata: Q7624675
  wikipedia: Strongly chordal graph
inventory: [GVH8841N2A]
---

## Summary

In the mathematical area of graph theory, an undirected graph $G$ is **strongly chordal** if it is a chordal graph and every [[cycle|0Z05VCBQ7Y]] of even length (≥ 6) in $G$ has an *odd chord*, i.e., an edge that connects two vertices that are an odd [[distance|0QV9VNNB4Z]] (>1) apart from each other in the cycle.