Sort by:

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in other words, removal of its endpoints leaves a path graph; Gallian 2007). A tree is a caterpillar iff all nodes of degree are surrounded by at most two nodes of degree two or greater.Caterpillar graphs are graceful.The number of caterpillar trees on nodes iswhere is the floor function (Harary and Schwenk 1973). For , 2, ... nodes, this gives 1, 1, 1, 2, 3, 6, 10, 20, 36, 72, 136, ... (OEIS A005418). The first few caterpillars are illustrated above.The number of noncaterpillar trees on , 8, ... as 1, 3, 11, 34, 99, ... (OEIS A052471). The noncaterpillar trees on nodes are illustrated above.

An -banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of copies of an -star graph with a single root vertex that is distinct from all the stars.Banana trees are graceful (Sethuraman and J. Jesintha2009, Gallian 2018).The -banana tree has rank polynomialPrecomputed properties of a number of banana trees is implemented in the Wolfram Language as GraphData["BananaTree", n, k].

The -hypercube graph, also called the -cube graph and commonly denoted or , is the graph whose vertices are the symbols , ..., where or 1 and two vertices are adjacent iff the symbols differ in exactly one coordinate.The graph of the -hypercube is given by the graph Cartesian product of path graphs . The -hypercube graph is also isomorphic to the Hasse diagram for the Boolean algebra on elements.The above figures show orthographic projections of some small -hypercube graphs using the first two of each vertex's set of coordinates. Note that above is a projection of the usual cube looking along a space diagonal so that the top and bottom vertices coincide, and hence only seven of the cube's eight vertices are visible. In addition, three of the central edges connect to the upper vertex, while the other three connect to the lower vertex.Hypercube graphs may be computed in the Wolfram Language using the command HypercubeGraph[n], and precomputed properties..

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, and icosahedral graph, are illustrated above. They are special cases of Schlegel graphs.Platonic graphs are graceful (Gardner 1983, pp. 158and 163-164).The following table summarizes the Platonic graphs and some of their properties.graph regularityHamiltonianEulerianvertex-transitiveedge-transitivecubical graphcubic81248yesnoyesyesdodecahedral graphcubic2030120yesnoyesyesicosahedral graphquintic1230120yesnoyesyesoctahedral graphquartic61248yesyesyesyestetrahedral graphcubic4624yesnoyesyes

The helm graph is the graph obtained from an -wheel graph by adjoining a pendant edge at each node of the cycle.Helm graphs are graceful (Gallian 2018), with the odd case of established by Koh et al. 1980 and the even case by Ayel and Favaron (1984). The helm graph is perfect only for and even .Precomputed properties of helm graphs are available in the Wolfram Language using GraphData["Helm", n, k].The -Helm graph has chromatic polynomial, independence polynomial, and matching polynomial given by(1)(2)(3)where . These correspond to recurrence equations (together with for the rank polynomial) of(4)(5)(6)(7)

A wheel graph of order , sometimes simply called an -wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a graph that contains a cycle of order , and for which every graph vertex in the cycle is connected to one other graph vertex (which is known as the hub). The edges of a wheel which include the hub are called spokes (Skiena 1990, p. 146). The wheel can be defined as the graph , where is the singleton graph and is the cycle graph. Note that there are two conventions for the indexing for wheel graphs, with some authors (e.g., Gallian 2007), adopting the convention that denotes the wheel graph on nodes.The tetrahedral graph (i.e., ) is isomorphic to , and is isomorphic to the complete tripartite graph . In general, the -wheel graph is the skeleton of an -pyramid. is one of the two graphs obtained by removing two edges from the pentatope graph , the other being the house X graph.Wheel graphs are graceful (Frucht..

The -pan graph is the graph obtained by joining a cycle graph to a singleton graph with a bridge. The -pan graph is therefore isomorphic with the -tadpole graph. The special case of the 3-pan graph is sometimes known as the paw graph and the 4-pan graph as the banner graph (ISGCI).Koh et al. (1980) showed that -tadpole graphs are graceful for , 1, or 3 (mod 4) and conjectured that all tadpole graphs are graceful (Gallian 2018). Guo (1994) apparently completed the proof by filling in the missing case in the process of showing that tadpoles are graceful when or 2 (mod 4) (Gallian 2018), thus establishing that pan graphs are graceful.The fact that the -pan graphs, corresponding to -tadpole graphs, are graceful for , 2 (mod 4) follows immediately from adding the label to the "handle" vertex adjacent to the verex with label 0 in a cycle graph labeling.Precomputed properties of pan graphs are available in the Wolfram Language as GraphData["Pan",..

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph vertices of the outer cycle (Gallian 2018). The gear graph has nodes and edges.Gear graphs are unit-distance and matchstickgraphs, as illustrated in the embeddings shown above.Attractive derived unit-distance graph are produced by taking the vertex sets from the matchstick embeddings and connecting all pairs of vertices separate by a unit distance for , 6, 12, and 18, illustrated above, with the case corresponding to the wheel graph .Ma and Feng (1984) proved that all gear graphs are graceful, and Liu (1996) showed that if two or more vertices are inserted between every pair of vertices of the outer cycle of the wheel, the resulting graph is also graceful (Gallian 2018).Precomputed properties of gear graphs are given in the Wolfram Language by GraphData["Gear",..

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph with the edges of the outer cycle removed.Web graphs are graceful.Precomputed properties of web graphs are available in the Wolfram Language as GraphData["Web", n].The term "web graph" is also used (e.g., Horvat and Pisanski 2010) to refer to the stacked prism graph itself, where is a cycle graph, is a path graph, and denotes a graph Cartesian product.The bipartite double graph of the web graph for odd is .

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph , the cocktail party graph , the complete tripartite graph , and the 4-dipyramidal graph. Several embeddings of this graph are illustrated above.It is implemented in the Wolfram Languageas GraphData["OctahedralGraph"].The octahedral graph has 6 nodes, 12 edges, vertex connectivity 4, edge connectivity 4, graph diameter 2, graph radius 2, and girth 3. It is the unique 6-node quartic graph, and is also a quartic symmetric graph. It has chromatic polynomialand chromatic number 3. It is an integral graph with graph spectrum . Its automorphism group is of order .The octahedral graph is the line graph of the tetrahedralgraph.There are three minimal integral drawings of the octahedral graph, illustrated above, all with maximum edge length of 7 (Harborth and Möller 1994).The..

An -firecracker is a graph obtained by the concatenation of -stars by linking one leaf from each (Chen et al. 1997, Gallian 2007).Firecracker graphs are graceful (Chen et al.1997, Gallian 2018).Precomputed properties of firecrackers are implemented in the Wolfram Language as GraphData["Firecracker", n, k].

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph and therefore also the wheel graph . It is implemented in the Wolfram Language as GraphData["TetrahedralGraph"].The tetrahedral graph has a single minimal integral drawing, illustrated above (Harborth and Möller 1994), with maximum edge length 4.The minimal planar integral drawing of the tetrahedral graph, illustrated above, has maximum edge length of 17 (Harborth et al. 1987). The tetrahedral graph is also graceful (Gardner 1983, pp. 158 and 163-164).The tetrahedral graph has 4 nodes, 6 edges, vertex connectivity 4, edge connectivity 3, graph diameter 1, graph radius 1, and girth 3. It has chromatic polynomial(1)(2)and chromatic number 4. It is planarand cubic symmetric.The tetrahedral graph is an integral graph with graph spectrum . Its automorphism group has order .The..

A Mongolian tent graph is defined as the graph obtained from the graph Cartesian product for odd by adding an extra vertex above the graph and joining every other vertex of the top row to the additional vertex (Lee 1985; Gallian 2011, p. 14).Mongolian tent graphs are graceful (Lee 1985, Gallian2018).A Mongolian village is defined as a graph formed by successively amalgamating copies of Mongolian tents with the same number of rows so that adjacent tents share a column.Precomputed properties of Mongolian tent graphs are implemented in the Wolfram Language as GraphData["MongolianTent", m, n].

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding shows a stereographic projection of the dodecahedron, the second an orthographic projection, the third is from Read and Wilson (1998, p. 162), and the fourth is derived from LCF notation.It is the cubic symmetric denoted and is isomorphic to the generalized Petersen graph . It can be described in LCF notation as [10, 7, 4, , , 10, , 7, , .It is distance-regular with intersection array and is also distance-transitive.It is also a unit-distance graph (Gerbracht2008), as shown above in a unit-distance drawing.Finding a Hamiltonian cycle on this graph is known as the icosian game. The dodecahedral graph is not Hamilton-connected and is the only known example of a vertex-transitive Hamiltonian graph (other than cycle graphs ) that is not H-*-connected (Stan Wagon, pers...

The -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 to a path graph with a bridge.The -tadpole graph is sometimes known as the -pan graph. The particular cases of the - and -tadpole graphs are also known as the paw graph and banner graph, respectively (ISGCI).Precomputed properties of tadpole graphs are available in the Wolfram Language as GraphData["Tadpole", m, n].Koh et al. (1980) showed that -tadpole graphs are graceful for , 1, or 3 (mod 4) and conjectured that all tadpole graphs are graceful (Gallian 2018). Guo (1994) apparently completed the proof by filling in the missing case in the process of showing that tadpoles are graceful when or 2 (mod 4) (Gallian 2018).

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order is a simple graph obtained by introducing a twist in a prism graph of order that is isomorphic to the circulant graph . Möbius ladders are sometimes denoted .The 4-Möbius ladder is known as the Wagner graph. The -Möbius ladder rung graph is isomorphic to the Haar graph .Möbius ladders are Hamiltonian. They are also graceful(Gallian 1987, Gallian 2018).The numbers of directed Hamiltonian cycles for , 4, ... are 12, 10, 16, 14, 20, 18, 24, ... (OEIS A124356), given by the closed form(1)The -Möbius ladder graph has independence polynomial(2)Recurrence equations for the independence polynomial and matching polynomial are given by(3)(4)The bipartite double graph of the -Möbius ladder is the prism graph ...

The -sunlet graph is the graph on vertices obtained by attaching pendant edges to a cycle graph (ISGCI), i.e., the coronas (Frucht 1979). Sunlet graphs have also been called crown graphs (e.g., Gallian 2018), a terminology that conflicts with the use of the term "crown graph" in this work to refer to a rook complement graph .Sunlet graphs are trivially unit-distance graphs, as well as matchstick graphs. They are also graceful (Frucht 1979).Note that Wallis (2000) and Anitha and Lekshmi (2008) use the term "-sun" graph to refer to sunlet graphs, whereas ISGCI and other authors reserve that term for a different type of graph.The 3-sunlet graph is also known as the net graph.If the restriction in the I graph is loosened, the -sunlet graph corresponds to .

The -ladder graph can be defined as , where is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the grid graph. The ladder graph is named for its resemblance to a ladder consisting of two rails and rungs between them (though starting immediately at the bottom and finishing at the top with no offset).Hosoya and Harary (1993) also use the term "ladder graph" for the graph Cartesian product , where is the complete graph on two nodes and is the cycle graph on nodes. This class of graph is however more commonly known as a prism graph.Ball and Coxeter (1987, pp. 277-278) use the term "ladder graph" to refer to the graph known in this work as the ladder rung graph.The ladder graph is graceful (Maheo 1980).The chromatic polynomial, independence polynomial, and reliability polynomial of the ladder graph are given by(1)(2)(3)where . Recurrence equations for the chromatic..

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent) such that every pair of graph vertices in the two sets are adjacent. If there are and graph vertices in the two sets, the complete bipartite graph is denoted . The above figures show and . is also known as the utility graph (and is the circulant graph ), and is the unique 4-cage graph. is a Cayley graph. A complete bipartite graph is a circulant graph (Skiena 1990, p. 99), specifically , where is the floor function.Special cases of are summarized in the table below.path graph path graph claw graphstar graph square graph utility graphThe numbers of (directed) Hamiltonian cycles for the graph with , 2, ... are 0, 2, 12, 144, 2880, 86400, 3628800, 203212800, ... (OEIS A143248), where..

The star graph of order , sometimes simply known as an "-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on nodes with one node having vertex degree and the other having vertex degree 1. The star graph is therefore isomorphic to the complete bipartite graph (Skiena 1990, p. 146).Note that there are two conventions for the indexing for star graphs, with some authors (e.g., Gallian 2007), adopting the convention that denotes the star graph on nodes. is isomorphic to "the" claw graph. A star graph is sometimes termed a "claw" (Hoffman 1960) or a "cherry" (Erdős and Rényi 1963; Harary 1994, p. 17).Star graphs are always graceful. Star graphs can be constructed in the Wolfram Language using StarGraph[n]. Precomputed properties of star graphs are available via GraphData["Star", n].The chromatic..

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the icosahedron, illustrated above in a number of embeddings. The icosahedral graph has 12 vertices and 30 edges.Since the icosahedral graph is regular and Hamiltonian, it has a generalized LCF notation. In fact, there are two distinct generalized LCF notations of order 6-- and --8 of order 2, and 17 of order 1, illustrated above.It is implemented in the Wolfram Languageas GraphData["IcosahedralGraph"].It is a distance-regular graph with intersection array , and therefore also a Taylor graph. It is also distance-transitive.There are two minimal integral drawings of the icosahedral graph, illustrated above, all with maximum edge length of 8 (Harborth and Möller 1994). It is also graceful (Gardner 1983, pp. 158 and 163-164; Gallian 2018, p. 35), with five fundamentally different labelings (Gardner 1983, p. 164).The..

A prism graph, denoted , (Gallian 1987), or (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted (Gross and Yellen 1999, p. 14), is a graph corresponding to the skeleton of an -prism. Prism graphs are therefore both planar and polyhedral. An -prism graph has nodes and edges, and is equivalent to the generalized Petersen graph . For odd , the -prism is isomorphic to the circulant graph , as can be seen by rotating the inner cycle by and increasing its radius to equal that of the outer cycle in the top embeddings above. In addition, for odd , is isomorphic to , , ..., . is isomorphic to the graph Cartesian product , where is the path graph on two nodes and is the cycle graph on nodes. As a result, it is a unit-distance graph (Horvat and Pisanski 2010).The prism graph is equivalent to the Cayley graph of the dihedral group with respect to the generating set (Biggs 1993, p. 126).The prism graph is the line graph of the complete..

The path graph is a tree with two nodes of vertex degree 1, and the other nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of its vertices and edges lie on a single straight line (Gross and Yellen 2006, p. 18).The path graph of length is implemented in the Wolfram Language as PathGraph[Range[n]], and precomputed properties of path graphs are available as GraphData["Path", n]. (Note that the Wolfram Language believes cycle graphs to be path graph, a convention that seems neither standard nor useful.)The path graph is known as the singleton graph and is equivalent to the complete graph and the star graph . is isomorphic to the complete bipartite graph and to .Path graphs are graceful.The path graph has chromatic polynomial, independence polynomial, matching polynomial, and reliability polynomial given by(1)(2)(3)(4)where . These have recurrence equations(5)(6)(7)(8)The line graph of..

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an lattice graph that is the graph Cartesian product of path graphs on and vertices. The grid graph is sometimes denoted (e.g., Acharya and Gill 1981).Unfortunately, the convention on which index corresponds to width and which to height remains murky. Some authors (e.g., Acharya and Gill 1981) use the same height by width convention applied to matrix dimensioning (which also corresponds to the order in which measurements of a painting on canvas are expressed). The Wolfram Language implementation GridGraph[m, n, ...] also adopts this ordering, returning an embedding in which corresponds to the height and the width. Other sources adopt the width by height convention used to measure paper, room dimensions, and windows (e.g., 8 1/2 inch by 11 inch paper is 8 1/2 inches wide and 11 inches high). Therefore, depending..

Check the price

for your project

for your project

we accept

Money back

guarantee

guarantee

Price calculator

We've got the best prices, check out yourself!