Gear Graph on:
[Wikipedia]
[Google]
[Amazon]
This partial list of graphs contains definitions of graphs and graph families which are known by particular names, but do not have a Wikipedia article of their own.
For collected definitions of graph theory terms that do not refer to individual graph types, such as ''vertex'' and ''path'', see
A gear graph, denoted ''G''''n'' is a graph obtained by inserting an extra vertex between each pair of adjacent vertices on the perimeter of a wheel graph ''W''''n''. Thus, ''G''''n'' has 2''n''+1 vertices and 3''n'' edges. Gear graphs are examples of squaregraphs, and play a key role in the forbidden graph characterization of squaregraphs. Gear graphs are also known as cogwheels and bipartite wheels.
Glossary of graph theory
This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.
Symbols
A
B
...
. For links to existing articles about particular kinds of graphs, see Graphs.
Gear
A gear graph, denoted ''G''''n'' is a graph obtained by inserting an extra vertex between each pair of adjacent vertices on the perimeter of a wheel graph ''W''''n''. Thus, ''G''''n'' has 2''n''+1 vertices and 3''n'' edges. Gear graphs are examples of squaregraphs, and play a key role in the forbidden graph characterization of squaregraphs. Gear graphs are also known as cogwheels and bipartite wheels.
Helm
A helm graph, denoted ''Hn'' is a graph obtained by attaching a single edge and node to each node of the outer circuit of a wheel graph ''Wn''.Lobster
A lobster graph is a tree in which all the vertices are within distance 2 of a central path. Compare ''caterpillar''.Web
The web graph ''W''''n'',''r'' is a graph consisting of ''r'' concentric copies of the cycle graph ''C''''n'', with corresponding vertices connected by "spokes". Thus ''W''''n'',1 is the same graph as ''C''''n'', and ''W''n,2 is a prism. A web graph has also been defined as a prism graph ''Y''''n''+1, 3, with the edges of the outer cycle removed.See also
*Gallery of named graphs
Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer. A famous example is the Petersen graph, a concrete graph on 10 vertices that appears as a minim ...
References