Search Results for ""

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...