Search Results for ""

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

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

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

The multiplicad is a simple example of an idea like the ruliad. It consists of a rulial multiway system based on the positive integers in which the rules simply multiply by ...

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...