Search Results for ""

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

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

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

A graph cycle.

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...