Search Results for ""

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

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 ...