Search Results for ""

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The tetragonal trapezohedron is the dual of the square antiprism. For a square antiprism with unit edge lengths, the edge lengths of the corresponding tetragonal ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...