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