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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:493bfab2a2ac · see in the full table