Search Results for ""

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

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

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

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

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...