De Bruijn graph
node-link graph representing overlaps between sequences of symbols
Press Enter · cited answer in seconds
0 sources
De Bruijn graph
Summary
De Bruijn graph is a mathematical concept[1]. It draws 79 Wikipedia views per month (mathematical_concept category, ranking #178 of 1,007).[2]
Key Facts
- De Bruijn graph's image is recorded as De Bruijin digraph.png[3].
- De Bruijn graph's instance of is recorded as mathematical concept[4].
- Nicolaas Govert de Bruijn is named after De Bruijn graph[5].
- De Bruijn graph's subclass of is recorded as directed graph[6].
- De Bruijn graph's Commons category is recorded as De Bruijn graphs[7].
- De Bruijn graph's Freebase ID is recorded as /m/075j58[8].
- De Bruijn graph's defining formula is recorded as V=S^n={(s_1,\dots,s_1,s_1),(s_1,\dots,s_1,s_2),\dots,(s_1,\dots,s_1,s_m),(s_1,\dots,s_2,s_1),\dots,(s_m,\dots,s_m,s_m)}[9].
- De Bruijn graph's studied by is recorded as graph theory[10].
- De Bruijn graph's MathWorld ID is recorded as deBruijnGraph[11].
- De Bruijn graph's maintained by WikiProject is recorded as WikiProject Mathematics[12].
- De Bruijn graph's Microsoft Academic ID is recorded as 20218877[13].
- De Bruijn graph's OpenAlex ID is recorded as C20218877[14].
Why It Matters
De Bruijn graph draws 79 Wikipedia views per month (mathematical_concept category, ranking #178 of 1,007).[2] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.[15]