Search Results for ""

The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

In general, a graph product of two graphs G and H is a new graph whose vertex set is V(G)×V(H) and where, for any two vertices (g,h) and (g^',h^') in the product, the ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

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

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...