Search Results for ""

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

The sequence of graphs starting with the Suzuki graph and successively taking local graphs, summarized in the following table, is known as the Suzuki tower, a name due to ...

A cubic lattice is a lattice whose points lie at positions (x,y,z) in the Cartesian three-space, where x, y, and z are integers. The term is also used to refer to a regular ...

An isozonohedron is a zonohedron whose faces consist of n(n-1) congruent rhombi (Fedorov 1953, pp. 256-266; Chilton and Coxeter 1963). The following table summarizes some of ...

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

The expected value B_n(s) of r^s from a fixed vertex of a unit n-cube to a point picked at random in the interior of the hypercube is given by B_n(s) = ...

A polar zonohedron is a convex zonohedron derived from the star which joins opposite vertices of any right n-gonal prism (for n even) or antiprism (for n odd). The faces of ...

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).