Search Results for ""

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

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 n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

A surface such as the Möbius strip or Klein bottle (Gray 1997, pp. 322-323) on which there exists a closed path such that the directrix is reversed when moved around this ...

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

Let a chess piece make a tour on an n×n chessboard whose squares are numbered from 1 to n^2 along the path of the chess piece. Then the tour is called a magic tour if the ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...