List of graphs by edges and vertices information

This sortable list points to the articles describing various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth'...

between all pairs of vertices, especially in median graphs and modular graphs. 2.  A median graph is a graph in which every three vertices have a unique median...

field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample...

mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often...

pair of adjacent vertices on the perimeter of a wheel graph Wn. Thus, Gn has 2n+1 vertices and 3n edges. Gear graphs are examples of squaregraphs, and play...

existence of Eulerian circuits is that all vertices in the graph have an even degree, and stated without proof that connected graphs with all vertices of even...

include both vertices and edges or only vertices as first class objects, and in what kinds of objects are used to represent the vertices and edges. An implementation...

way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring...

acyclic graphs are sometimes instead called acyclic directed graphs or acyclic digraphs. A graph is formed by vertices and by edges connecting pairs of vertices...

mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order v1, v2, …, vn such that the edges are {vi...

undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal...

field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices and 3n edges. The...

1)/2 edges, a 1/n fraction of the total. Several authors have studied edge colorings of the odd graphs, n-regular graphs in which the vertices represent...

is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts...

complete graphs with a set of edges making a perfect matching removed. Additional families of symmetric graphs with an even number of vertices 2n, are...

to multigraphs and graphs with loops by storing the number of edges between each two vertices in the corresponding matrix element, and by allowing nonzero...

connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized...

graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges....