Search Results for ""

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...