281 - 290 of 724 for GraphSearch Results
View search results from all Wolfram sites (12491 matches)
ExtractCycles   (Combinatorica Package Symbol)
ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.
MaximumSpanningTree   (Combinatorica Package Symbol)
MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.
NumberOfSpanningTrees   (Combinatorica Package Symbol)
NumberOfSpanningTrees[g] gives the number of labeled spanning trees of graph g.
PlanarQ   (Combinatorica Package Symbol)
PlanarQ[g] yields True if graph g is planar, meaning it can be drawn in the plane so no two edges cross.
PseudographQ   (Combinatorica Package Symbol)
PseudographQ[g] yields True if graph g is a pseudograph, meaning it contains self-loops.
Radius   (Combinatorica Package Symbol)
Radius[g] gives the radius of graph g, the minimum eccentricity of any vertex of g.
SelfComplementaryQ   (Combinatorica Package Symbol)
SelfComplementaryQ[g] yields True if graph g is self-complementary, meaning it is isomorphic to its complement.
SelfLoopsQ   (Combinatorica Package Symbol)
SelfLoopsQ[g] yields True if graph g has self-loops.
SimpleQ   (Combinatorica Package Symbol)
SimpleQ[g] yields True if g is a simple graph, meaning it has no multiple edges and contains no self-loops.
TransitiveReduction   (Combinatorica Package Symbol)
TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.
1 ... 26|27|28|29|30|31|32 ... 73 Previous Next

...