Return the algebraic connectivity of an undirected graph.
The algebraic connectivity of a connected undirected graph is the second smallest eigenvalue of its Laplacian matrix.
Parameters: | G : NetworkX graph
weight : object, optional
normalized : bool, optional
tol : float, optional
method : string, optional
|
||||||||
---|---|---|---|---|---|---|---|---|---|
Returns: | algebraic_connectivity : float
|
||||||||
Raises: | NetworkXNotImplemented :
NetworkXError :
|
See also
laplacian_matrix
Notes
Edge weights are interpreted by their absolute values. For MultiGraph’s, weights of parallel edges are summed. Zero-weighted edges are ignored.
To use Cholesky factorization in the TraceMIN algorithm, the scikits.sparse package must be installed.