1Null graph 2directed: false 3vcount: 0 4edges: { 5} 6 7Directed null graph 8directed: true 9vcount: 0 10edges: { 11} 12 13Singleton graph 14directed: false 15vcount: 1 16edges: { 17} 18 19Path graph 20directed: true 21vcount: 3 22edges: { 230 1 241 2 25} 26 27Binary out-tree, n=3 28directed: true 29vcount: 3 30edges: { 310 1 320 2 33} 34 35Binary in-tree, n=3 36directed: true 37vcount: 3 38edges: { 391 0 402 0 41} 42 43Ternary out-tree, n=14 44directed: true 45vcount: 14 46edges: { 470 1 480 2 490 3 501 4 511 5 521 6 532 7 542 8 552 9 563 10 573 11 583 12 594 13 60} 61 62