entanglement of G is 0 if and only if G is acyclic¶
entanglement of G is 0 if and only if G is acyclic.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Entanglement (graph measure)
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
This sourceEntanglement has also been a key notion in proving that the variable hierarchy of the modal mu calculus is strict. D. Berwanger, E. Grädel and G. Lenzi, The variable hierarchy of the mu-calculus is strict, Theory of Computing Systems, vol. 40, pp. 437–466 (2007).
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:493bfab2a2ac · see in the full table