Project a bipartite graph
Growing random graph generation
Burt's constraint
Graph motifs
Geometric random graphs
Generate random graphs with a given degree sequence
The igraph package
edge.betweenness.community
Community structure detection based on edge betweenness
Create a bipartite graph
Interactive plotting of graphs
De Bruijn graphs.
Decompose a graph into components
Graph Laplacian
Permute the vertices of a graph
Triad census, subgraphs with three vertices
Various vertex shapes when plotting igraph graphs
Create graphs from an incidence matrix
K-core decomposition of graphs
Modularity of a community structure of a graph
Merging graph layouts
Diameter of a graph
Community structure via greedy optimization of modularity
Girth of a graph
Adjacency lists
Shortest (directed or undirected) paths between vertices
Find mutual edges in a directed graph
Similarity measures of two vertices
Method for structural manipulation of graphs
Write graphs and their cohesive block hierarchy as Pajek files
Generate coordinates for plotting graphs
Drawing graphs
Calculate Cohesive Blocks
Kleinberg's centrality scores.
leading.eigenvector.community
Community structure detecting based on the leading eigenvector
of the community matrix
Graph operators
Subgraph of a graph
Experimental basic igraph GUI
Creating (small) graphs via a simple interface
Reciprocity of graphs
Parameters for the igraph package
Generate an evolving random graph with preferential attachment
and aging
Connected components of a graph
Running mean of a time series
In- or out- component of a vertex
Convert between directed and undirected graphs
Number of automorphisms
The Watts-Strogatz small-world model
Generate random graphs according to the Erdos-Renyi model
Various methods for creating graphs
Creating named graphs
Average nearest neighbor degree
Finding communities in graphs based on statistical meachanics
Load a graph from the graph database for testing graph
isomorphism.
Line graph of a graph
Vertex and edge betweenness centrality
Generate scale-free graphs according to the Barabasi-Albert
model
Minimum spanning tree
Reading foreign file formats
Graph rewiring
Common functions supporting community detection algorithms
Plotting of graphs
Find Bonacich Power Centrality Scores of Network Positions
Degree and degree distribution of the vertices
Articulation points of a graph
Graphs from adjacency lists
Create graphs from adjacency lists
Convert a graph to an adjacency matrix or an edge list
Strength or weighted vertex degree
Creating a graph from LCF notation
Print graphs to the terminal
Graph Isomorphism
Graph density
Community strucure via short random walks
Topological sorting of vertices in a graph
Transitivity of a graph
Vertex and edge sequences and iterators
ARPACK eigenvector calculation
Find the multiple or loop edges in a graph
Find Bonacich alpha centrality scores of network positions
Cocitation coupling
The DrL graph layout generator
Writing the graph to a file in some format
Forest Fire Network Model
Edge connectivity.
Decide whether a graph is bipartite
The Page Rank algorithm
Kautz graphs
Gaining information about graph structure
Graph generation based on different vertex types
Neighborhood of graph vertices
Simple graphs
Plot graphs and their cohesive block hierarchy
Canonical permutation of a graph
Independent vertex sets
Sampling a random integer sequence
igraph from/to graphNEL conversion
Convert igraph graphs to graphNEL objects or back
Create a full bipartite graph
label.propagation.community
Finding communities based on propagating labels
Generate coordinates to place the vertices of a graph in a
star-shape
Trait-based random generation
Convert a general graph into a forest
Biconnected components
Graph, vertex and edge attributes
The functions find cliques, ie. complete subgraphs in a graph
Dyad census of a graph
Create graphs from adjacency matrices
3D plotting of graphs with OpenGL
Fitting a power-law distribution function to discrete data
Creating igraph graphs from data frames
Vertex connectivity.
Closeness centrality of vertices
Incidence matrix of a bipartite graph
Find Eigenvector Centrality Scores of Network Positions
Maximum flow in a network
Is this object a graph?
Rewires the endpoints of the edges of a graph randomly