MakeDirected[g] constructs a directed graph from a given undirected graph g by replacing each undirected edge in g by two directed edges pointing in opposite directions.

MeredithGraph returns a 4-regular, 4-connected graph that is not Hamiltonian, providing a counterexample to a conjecture by C. St. J. A. Nash\[Dash]Williams.

MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.

NecklacePolynomial[n, c, Cyclic] returns a polynomial in the colors in c whose coefficients represent numbers of ways of coloring an n-bead necklace with colors chosen from ...

Neighborhood[g, v, k] returns the subset of vertices in g that are at a distance of k or less from vertex v. Neighborhood[al, v, k] behaves identically, except that it takes ...

NetworkFlow[g, source, sink] returns the value of a maximum flow through graph g from source to sink. NetworkFlow[g, source, sink, Edge] returns the edges in g that have ...

NextComposition[l] constructs the integer composition that follows l in a canonical order.

NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.

NormalDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.

NthPair[n] returns the n\[Null]^th unordered pair of distinct positive integers, when sequenced to minimize the size of the larger integer. Pairs that have the same larger ...