Search Results for ""

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

The term domain has (at least) three different meanings in mathematics. The term domain is most commonly used to describe the set of values D for which a function (map, ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...