reachability

whether one vertex can be reached from another in a graph
Thing Binary Relation Q1361526

Facts

3 properties
Instance of
binary relation
Characteristic of
node[3]
Studied by
graph theory[2]
🏷️ Also known as
en reachability en reachability relation de Erreichbarkeit hu elérhetőség hu elérhetőségi reláció ja 到達可能性 ko 도달성 pl osiągalność pt acessibilidade ru достижимость zh 可到達性 zh 可达性 zh-hant 可達性
🔖 Identifiers · 3
OpenAlex ID
C136643341
Freebase ID
/m/03bx8d3
Microsoft Academic ID (discontinued)
136643341

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Characteristic of 1
Instance of 1
Studied by 1
← Uses 1
Press Enter · cited answer in seconds

Summary

reachability is a binary relation[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). reachability. Retrieved November 17, 2026, from https://4ort.xyz/entity/reachability
MLA “reachability.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Nov. 2026, https://4ort.xyz/entity/reachability.
BibTeX @misc{4ortxyz_reachability_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{reachability}}, year = {2026}, url = {https://4ort.xyz/entity/reachability}, note = {Accessed: 2026-11-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): reachability — https://4ort.xyz/entity/reachability (retrieved 2026-11-17)

Canonical URL: https://4ort.xyz/entity/reachability · Last refreshed: