Search Results for ""

A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...

The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

Define a = d(u,v)d(w,x) (1) b = d(u,w)d(v,x) (2) c = d(u,x)d(v,w), (3) where u, v, w, and x are vertices of a graph and d(i,j) is the graph distance between vertices i and j. ...