|
Graph Diagram |
|
|
|
|
|
|
|
|
Property |
|||||||
|
|
|||||||
|
# of points |
6 |
|
|
|
|
|
|
|
# of lines |
8 |
|
|
|
|
|
|
|
# of components |
1 |
|
|
|
|
|
|
|
Diameter |
2 |
|
|
|
|
|
|
|
Radius |
1 |
|
|
|
|
|
|
|
# of central points |
1 |
|
|
|
|
|
|
|
Girth |
3 |
|
|
|
|
|
|
|
circumference |
5 |
|
|
|
|
|
|
|
Maximum degree |
5 |
|
|
|
|
|
|
|
Minimum degree |
1 |
|
|
|
|
|
|
|
Size of largest clique |
3 |
|
|
|
|
|
|
|
Size of largest independent set |
3 |
|
|
|
|
|
|
|
Size of maximum matching |
3 |
|
|
|
|
|
|
|
# of blocks |
2 |
|
|
|
|
|
|
|
# of cut-points |
1 |
|
|
|
|
|
|
|
Chromatic number |
3 |
|
|
|
|
|
|
|
# of triangles |
3 |
|
|
|
|
|
|
|
# of cliques |
4 |
|
|
|
|
|
|
|
Size of minimum cut |
1 |
|
|
|
|
|
|
|
Density of sparest cut |
1/5 |
|
|
|
|
|
|
|
# of lines in any maximum spanning bipartite subgraph |
6 |
|
|
|
|
|
|
|
Maximum number of points in any induced bipartite subgraph |
5 |
|
|
|
|
|
|
