371 - 380 of 724 for GraphSearch Results
View search results from all Wolfram sites (12491 matches)
UnionSet   (Combinatorica Package Symbol)
UnionSet[a, b, s] merges the sets containing a and b in union-find data structure s.
UnweightedQ   (Combinatorica Package Symbol)
UnweightedQ[g] yields True if all edge weights are 1 and False otherwise.
Red   (Built-in Mathematica Symbol)
Red represents the color red in graphics or style specifications.
GraphJoin   (Combinatorica Package Symbol)
GraphJoin[g_1, g_2, ...] constructs the join of graphs g_1, g_2, and so on. This is the graph obtained by adding all possible edges between different graphs to the graph ...
ConnectedComponents   (Combinatorica Package Symbol)
ConnectedComponents[g] gives the vertices of graph g partitioned into connected components.
DilateVertices   (Combinatorica Package Symbol)
DilateVertices[v, d] multiplies each coordinate of each vertex position in list v by d, thus dilating the embedding. DilateVertices[g, d] dilates the embedding of graph g by ...
PartialOrderQ   (Combinatorica Package Symbol)
PartialOrderQ[g] yields True if the binary relation defined by edges of the graph g is a partial order, meaning it is transitive, reflexive, and antisymmetric. ...
SymmetricQ   (Combinatorica Package Symbol)
SymmetricQ[r] tests if a given square matrix r represents a symmetric relation. SymmetricQ[g] tests if the edges of a given graph represent a symmetric relation.
CoxeterGraph   (Combinatorica Package Symbol)
CoxeterGraph gives a non-Hamiltonian graph with a high degree of symmetry such that there is a graph automorphism taking any path of length 3 to any other.
EdgeDirection   (Combinatorica Package Symbol)
EdgeDirection is an option that takes on values True or False allowing the user to specify whether the graph is directed or not. EdgeDirection can be set as part of the graph ...
1 ... 35|36|37|38|39|40|41 ... 73 Previous Next

...