Search Results for ""

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

An element of an adèle group, sometimes called a repartition in older literature (e.g., Chevalley 1951, p. 25). Adèles arise in both number fields and function fields. The ...

The second-order ordinary differential equation xy^('')+(c-x)y^'-ay=0, sometimes also called Kummer's differential equation (Slater 1960, p. 2; Zwillinger 1997, p. 124). It ...