Return the Fiedler vector of a connected undirected graph.
The Fiedler vector of a connected undirected graph is the eigenvector corresponding to the second smallest eigenvalue of the Laplacian matrix of of the graph.
Parameters: | G : NetworkX graph
weight : object, optional
normalized : bool, optional
tol : float, optional
method : string, optional
|
||||||||
---|---|---|---|---|---|---|---|---|---|
Returns: | fiedler_vector : NumPy array of floats.
|
||||||||
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.