541 - 550 of 1008 for graph drawingSearch Results
View search results from all Wolfram sites (14939 matches)
RegularQ   (Combinatorica Package Symbol)
RegularQ[g] yields True if g is a regular graph.
RemoveMultipleEdges   (Combinatorica Package Symbol)
RemoveMultipleEdges[g] returns the graph obtained by deleting multiple edges from g.
RemoveSelfLoops   (Combinatorica Package Symbol)
RemoveSelfLoops[g] returns the graph obtained by deleting self-loops in g.
ReverseEdges   (Combinatorica Package Symbol)
ReverseEdges[g] flips the directions of all edges in a directed graph.
SmallestCyclicGroupGraph   (Combinatorica Package Symbol)
SmallestCyclicGroupGraph returns a smallest nontrivial graph whose automorphism group is cyclic.
TreeQ   (Combinatorica Package Symbol)
TreeQ[g] yields True if graph g is a tree.
Uniquely3ColorableGraph   (Combinatorica Package Symbol)
Uniquely3ColorableGraph returns a 12-vertex, triangle-free graph with chromatic number 3 that is uniquely 3-colorable.
UnitransitiveGraph   (Combinatorica Package Symbol)
UnitransitiveGraph returns a 20-vertex, 3-unitransitive graph, discovered by Coxeter, that is not isomorphic to a 4-cage or a 5-cage.
VertexCoverQ   (Combinatorica Package Symbol)
VertexCoverQ[g, c] yields True if the vertices in list c define a vertex cover of graph g.
Backtrack   (Combinatorica Package Symbol)
Backtrack[s, partialQ, solutionQ] performs a backtrack search of the state space s, expanding a partial solution so long as partialQ is True and returning the first complete ...
1 ... 52|53|54|55|56|57|58 ... 101 Previous Next

...