Strongly chordal graph
Summary
In the mathematical area of graph theory, an undirected graph is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in has an odd chord, i.e., an edge that connects two vertices that are an odd distance (>1) apart from each other in the cycle.
Further reading
- Wikipedia, page 24809733, revision 1369813176, Strongly chordal graph. adopted
About this page
| Tag | 2QVEM9KHHK |
|---|---|
| URI | m2://2QVEM9KHHK |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.