Search Results for ""

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

Graph Strength

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...