Search Results for ""

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

Let two disks of radius r intersect one another perpendicularly and have a diameter in common. If the distance between the centers of the disks is sqrt(2) times their radius, ...

The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The average distance between two points chosen at random inside a unit cube (the n=3 case of hypercube line picking), sometimes known as the Robbins constant, is Delta(3) = ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...