Search Results for ""

The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...

The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

The term in rigidity theory for the edges of a graph.

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...