Search Results for ""

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar. The n-antiprism graph has 2n vertices and ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

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

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...