最終更新日：2024/08/05
(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.
正解を見る
Moore graph
編集履歴（0）
(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.
Moore graph
DiQt（ディクト）
無料
★★★★★★★★★★
