complete graph K2

Summary

complete graph K2 is a complete graph^[1].

Key Facts

• complete graph K2's image is recorded as Complete graph K2.svg^[2].
• complete graph K2's instance of is recorded as complete graph^[3].
• complete graph K2's instance of is recorded as planar graph^[4].
• complete graph K2's instance of is recorded as star graph^[5].
• complete graph K2's instance of is recorded as path graph^[6].
• complete graph K2's instance of is recorded as ladder graph^[7].
• complete graph K2's instance of is recorded as dipole graph^[8].
• complete graph K2's instance of is recorded as half graph^[9].
• complete graph K2's instance of is recorded as hypercube graph^[10].
• complete graph K2's instance of is recorded as ladder rung graph^[11].
• complete graph K2's instance of is recorded as Fibonacci cube^[12].
• complete graph K2's instance of is recorded as centipede graph^[13].
• complete graph K2's instance of is recorded as Laman graph^[14].
• complete graph K2's instance of is recorded as Sierpiński graph^[15].
• complete graph K2's instance of is recorded as series-reduced tree^[16].
• complete graph K2's instance of is recorded as balanced biclique^[17].
• complete graph K2's instance of is recorded as Andrásfai graph^[18].
• complete graph K2's instance of is recorded as Mycielski graph^[19].
• complete graph K2's instance of is recorded as halved cube graph^[20].
• complete graph K2's instance of is recorded as folded cube graph^[21].
• complete graph K2's Commons category is recorded as Single edge graph^[22].
• complete graph K2's studied by is recorded as graph theory^[23].
• complete graph K2's has part is recorded as node^[24].
• complete graph K2's has part is recorded as edge^[25].
• complete graph K2's Wolfram Language entity code is recorded as Entity["Graph", "P2"]^[26].