Folkman graph

Summary

Folkman graph is a semi-symmetric graph^[1]. It draws 61 Wikipedia views per month (semi_symmetric_graph category, ranking #1 of 1).^[2]

Key Facts

• Folkman graph's instance of is recorded as semi-symmetric graph^[3].
• Folkman graph's instance of is recorded as bipartite graph^[4].
• Folkman graph's instance of is recorded as Hamiltonian graph^[5].
• Folkman graph's instance of is recorded as quartic graph^[6].
• Folkman graph's instance of is recorded as perfect graph^[7].
• Jon Folkman is named after Folkman graph^[8].
• Folkman graph's Commons category is recorded as Folkman graph^[9].
• Folkman graph's studied by is recorded as graph theory^[10].
• Folkman graph's has part is recorded as node^[11].
• Folkman graph's has part is recorded as edge^[12].
• Folkman graph's maintained by WikiProject is recorded as WikiProject Mathematics^[13].
• Folkman graph's graph radius is recorded as {'amount': '+3'}^[14].
• Folkman graph's graph diameter is recorded as {'amount': '+4'}^[15].
• Folkman graph's graph girth is recorded as {'amount': '+4'}^[16].

Body

Definition and Type

Recorded instance of include semi-symmetric graph^[3], bipartite graph^[4], Hamiltonian graph^[5], quartic graph^[6], and perfect graph^[7].

Origins

Jon Folkman is named after Folkman graph^[8].

Why It Matters

Folkman graph draws 61 Wikipedia views per month (semi_symmetric_graph category, ranking #1 of 1).^[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[17] It is known by 7 alternative names across languages and contexts.^[18]