Girth of a graph
Graph density
The Page Rank algorithm
In- or out- component of a vertex
Degree and degree distribution of the vertices
Independent vertex sets
Decompose a graph into components
Vertex and edge betweenness centrality
Running mean of a time series
Generate coordinates for plotting graphs
Fitting a power-law distribution function to discrete data
Write graphs and their cohesive block hierarchy as Pajek files
Diameter of a graph
Graph operators
Burt's constraint
Biconnected components
Drawing graphs
Writing the graph to a file in some format
Finding communities in graphs based on statistical meachanics
The functions find cliques, ie. complete subgraphs in a graph
Transitivity of a graph
Shortest (directed or undirected) paths between vertices
Measuring the driving force in evolving networks
Graph motifs
Edge connectivity.
Growing random graph generation
Plotting of graphs
Rewires the endpoints of the edges of a graph randomly
Generate random graphs according to the Erdos-Renyi model
Load a graph from the graph database for testing graph
isomorphism.
Common functions supporting community detection algorithms
Find Eigenvector Centrality Scores of Network Positions
Generate an evolving random graph with preferential attachment
and aging
Neighborhood of graph vertices
Convert a graph to an adjacency matrix or an edge list
Graph generation based on different vertex types
Measuring the driving force in evolving networks
Topological sorting of vertices in a graph
Calculate Cohesive Blocks
Articulation points of a graph
Method for structural manipulation of graphs
Undocumented and unsupportted igraph functions
Parameters for the igraph package
edge.betweenness.community
Community structure detection based on edge betweenness
Convert between directed and undirected graphs
Remove loop and/or multiple edges from a graph
Graph rewiring
Vertex and edge sequences and iterators
Interactive plotting of graphs
Merging graph layouts
Modularity of a community structure of a graph
Minimum spanning tree
Connected components of a graph
Reciprocity of graphs
3D plotting of graphs with OpenGL
Trait-based random generation
Reading foreign file formats
The Watts-Strogatz small-world model
Generate random graphs with a given degree sequence
Various methods for creating graphs
Find Bonacich alpha centrality scores of network positions
Is this object a graph?
Community structure via greedy optimization of modularity
Subgraph of a graph
Geometric random graphs
Gaining information about graph structure
Graph Laplacian
Graph Isomorphism
Plot graphs and their cohesive block hierarchy
Vertex connectivity.
Find Bonacich Power Centrality Scores of Network Positions
K-core decomposition of graphs
Community strucure via short random walks
Print graphs to the terminal
Sampling a random integer sequence
Generate scale-free graphs according to the Barabasi-Albert
model
Graph, vertex and edge attributes
Cocitation coupling
Closeness centrality of vertices
Maximum flow in a network
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix