Claws and Clawless Graphs

Some Steinhaus graphs contain a property known as a "claw." This property occurs when one vertex can be connected to three other vertices while remaining acyclic.

The following example is a graph which contains a claw.

0	1	1	1	0	0
1	0	0	0	1	0
1	0	0	0	1	1
1	0	0	0	1	0
0	1	1	1	0	1
0	0	1	0	1	0

In the above example, the claw at vertex 1 is highlighted in red. Another claw can also be observed at vertex 5.

Discoveries