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