This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
spectral_bipartivity(G, nodes=None, weight='weight')¶
Returns the spectral bipartivity.
- G (NetworkX graph) –
- nodes (list or container optional(default is all nodes)) – Nodes to return value of spectral bipartivity contribution.
- weight (string or None optional (default = ‘weight’)) – Edge data key to use for edge weights. If None, weights set to 1.
sb – A single number if the keyword nodes is not specified, or a dictionary keyed by node with the spectral bipartivity contribution of that node as the value.
float or dict
>>> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> bipartite.spectral_bipartivity(G) 1.0
This implementation uses Numpy (dense) matrices which are not efficient for storing large sparse graphs.
 E. Estrada and J. A. Rodríguez-Velázquez, “Spectral measures of bipartivity in complex networks”, PhysRev E 72, 046105 (2005)