VertexLabeling is an option for GraphPlot and related functions which specifies whether labeling should be included by default for vertices in graphs.
FindIndependentEdgeSet[g] finds an independent edge set of the graph g with a maximum number of edges.
DistributionFitTest[data] tests whether data is normally distributed. DistributionFitTest[data, dist] tests whether data is distributed according to dist. ...
StationaryWaveletPacketTransform[data] gives the stationary wavelet packet transform (SWPT) of an array of data.StationaryWaveletPacketTransform[data, wave] gives the ...
ToCombinatoricaGraph[g] return the Combinatorica representation of the graph g.ToCombinatoricaGraph[g, n] return the graph g, adding additional unconnected vertices, if ...
KCoreComponents[g, k] gives the k-core components of the underlying simple graph of g.KCoreComponents[g, k, "InDegree"] gives the k-core components with vertex in-degrees at ...
Mathematica provides systemwide support for a large number of special characters. Each character has a name and a number of shortcut aliases. They are fully supported by the ...
FindEdgeCover[g] finds an edge cover of the graph g with a minimum number of edges.
CliqueQ
(Combinatorica Package Symbol) CliqueQ[g, c] yields True if the list of vertices c defines a clique in graph g.
DegreesOf2Neighborhood[g, v] returns the sorted list of degrees of vertices of graph g within a distance of 2 from v.