Qurak

HararyGraph

در دسترس

Minimal k-connected Harary graph on n vertices

HararyGraph[k, n]
Table[HararyGraph[i, 8, PlotLabel -> Subscript[H, i, 8]], {i, 2, 4}] → {Graph[<8>, <8>], Graph[<8>, <12>], Graph[<8>, <16>]}g = HararyGraph[2, 8, VertexLabels -> "Name"] → Graph[<8>, <8>]Table[GraphRadius[HararyGraph[i, 6]], {i, 2, 5}] → {3, 2, 2, 1}

موضوع‌ها

مرتبط

همهٔ 6300 تابع · استفاده از این در کلاینت MCP