>
|
|
>
|
|
>
|
|
| (1) |
The DegreeSequence command returns a list of degrees of the vertices for a given graph.
| (2) |
>
|
|
| (3) |
To view the degree distribution of a Barabási-Albert graph:
>
|
|
Generate a sequence of Barabási-Albert graphs with 20 initial vertices.
>
|
|
A graph is bi-connected if it is connected and removal of any vertex from the graph does not disconnect it. A maximal bi-connected subgraph is called a bi-connected component.
>
|
|
To view the distribution of the number of vertices in the bi-connected components.
>
|
|
The graphs above typically have one large bi-connected component and several smaller ones that generally have degree 1. This can be visualized as follows for the first graph in the sequence.
| (4) |
>
|
|
| (6) |
>
|
|
>
|
|