Search Results for ""

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

The closed graph theorem states that a linear operator between two Banach spaces X and Y is continuous iff it has a closed graph, where the "graph" {(x,f(x)):x in X} is ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...