Functions

Degree

degree_sequence(G)	Return the degree sequence of G.
min_degree(G)	Return the minimum degree of G.
max_degree(G)	Return the maximum degree of G.
average_degree(G)	Return the average degree of G.
number_of_nodes_of_degree_k(G, k)	Return the number of nodes of the graph with degree equal to k.
number_of_degree_one_nodes(G)	Return the number of nodes of the graph with degree equal to 1.
number_of_min_degree_nodes(G)	Return the number of nodes of the graph with degree equal to the minimum degree of the graph.
number_of_max_degree_nodes(G)	Return the number of nodes of the graph with degree equal to the maximum degree of the graph.
neighborhood_degree_list(G, nbunch)	Return a list of the unique degrees of all neighbors of nodes in nbunch
closed_neighborhood_degree_list(G, nbunch)	Return a list of the unique degrees of all nodes in the closed neighborhood of the nodes in nbunch.

Neighborhoods

neighborhood(G, nbunch)	Return a list of all neighbors of the nodes in nbunch.
closed_neighborhood(G, nbunch)	Return a list of all neighbors of the nodes in nbunch, including the nodes in nbunch.
are_neighbors(G, v, nbunch)	Returns true if v is adjacent to any of the nodes in nbunch.