Goldner–Harary graph
0 sources
Goldner–Harary graph
Summary
Goldner–Harary graph is an integral graph[1]. It draws 11 Wikipedia views per month (integral_graph category, ranking #2 of 2).[2]
Key Facts
- Goldner–Harary graph's image is recorded as Goldner-Harary graph.svg[3].
- Goldner–Harary graph's instance of is recorded as integral graph[4].
- Goldner–Harary graph's instance of is recorded as polyhedral graph[5].
- Goldner–Harary graph's instance of is recorded as maximal planar graph[6].
- Goldner–Harary graph's instance of is recorded as chordal graph[7].
- Goldner–Harary graph's instance of is recorded as perfect graph[8].
- Goldner–Harary graph's instance of is recorded as Apollonian network[9].
- Goldner–Harary graph's instance of is recorded as traceable graph[10].
- Goldner–Harary graph's Commons category is recorded as Goldner–Harary graphs[11].
- Goldner–Harary graph's Freebase ID is recorded as /m/080ctqb[12].
- Goldner–Harary graph's studied by is recorded as graph theory[13].
- Goldner–Harary graph's has part is recorded as node[14].
- Goldner–Harary graph's has part is recorded as edge[15].
- Goldner–Harary graph's MathWorld ID is recorded as Goldner-HararyGraph[16].
- Goldner–Harary graph's Wolfram Language entity code is recorded as Entity["Graph", "GoldnerHararyGraph"][17].
- Goldner–Harary graph's maintained by WikiProject is recorded as WikiProject Mathematics[18].
- Goldner–Harary graph's graph radius is recorded as {'amount': '+2'}[19].
- Goldner–Harary graph's graph diameter is recorded as {'amount': '+2'}[20].
- Goldner–Harary graph's graph girth is recorded as {'amount': '+3'}[21].
- Goldner–Harary graph's The House of Graphs ID is recorded as 1110[22].
Why It Matters
Goldner–Harary graph draws 11 Wikipedia views per month (integral_graph category, ranking #2 of 2).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[23]