MaximalIndepndentEdgeSet[g] gives a maximal independent edge set of an undirected graph g.
AdjacencyMatrix[g] gives the SparseArray object representing the graph g.AdjacencyMatrix[g, n] gives the SparseArray object representing the graph g, adding additional ...
DIMACS
(Mathematica Import/Export Format) DIMACS graph data format. Commonly used exchange format for graphs. Stores a single undirected graph. Plain text or binary format. DIMACS is an acronym derived from Discrete ...
Graph6
(Mathematica Import/Export Format) Graph6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for small graphs or large ...
LEDA
(Mathematica Import/Export Format) LEDA graph data format. Commonly used exchange format for graphs. Stores a single, typed, directed, or undirected graph. Plain text format. Native graph file format of the ...
Pajek
(Mathematica Import/Export Format) Pajek graph language and data format. Commonly used exchange format for graphs. Native format of the Pajek network analysis software. The format name is Slovenian for spider. ...
Sparse6
(Mathematica Import/Export Format) sparse6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for large sparse graphs, ...
TGF
(Mathematica Import/Export Format) TGF graph data format. Used for the storage and exchange of graphs. TGF is an acronym for Trivial Graph Format. Stores directed graphs. Stores at most one label per vertex ...
LayeredGraphPlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a layered plot of the graph in which vertex v_ik is connected to vertex v_jk.LayeredGraphPlot[{{v i 1 -> v j ...
PseudoDiameter[g] give the pseudo-diameter of the undirected graph g, and the two vertices that achieve this diameter.