InDegree[g, n] returns the in-degree of vertex n in directed graph g. InDegree[g] returns the sequence of in-degrees of the vertices in directed graph g.

OrientGraph[g] assigns a direction to each edge of a bridgeless, undirected graph g, so that the graph is strongly connected.

OutDegree[g, n] returns the out-degree of vertex n in directed graph g. OutDegree[g] returns the sequence of out-degrees of the vertices in directed graph g.

TwoColoring[g] finds a two-coloring of graph g if g is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.

FindIndependentEdgeSet[g] finds an independent edge set of the graph g with a maximum number of edges.

Mathematica is the tool that has made possible Stephen Wolfram's exploration of the computational universe, and the emerging field of Wolfram Science (NKS). Whether for ...

GraphUnion[g_1, g_2, ...] constructs the union of graphs g_1, g_2, and so forth. GraphUnion[n, g] constructs n copies of graph g, for any nonnegative integer n.

NonLineGraphs returns a graph whose connected components are the 9 graphs whose presence as a vertex-induced subgraph in a graph g makes g a nonline graph.

Mathematica offers multiple ways of plotting functions of one variable. These include ordinary plots, log plots, parametric plots, and polar plots.

FindEdgeCover[g] finds an edge cover of the graph g with a minimum number of edges.