Search Results for ""

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

Any link can be represented by a closed braid.

The number of empty neighbors of a cluster.

A graph cycle.

e is transcendental.

The double-struck capital letter I, I, is a symbol sometimes used instead of Z for the ring of integers. In contrast, the lower case symbol i is used to refer to the ...

Definitions about a set which depend on the entire set.

A general concept in category theory involving the globalization of local morphisms.