Search Results for ""

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

An enneahedron, also called a nonahedron, is a nine-faced polyhedron. The term "enneahedron" is generally preferred over "nonahedron" since while the former combines the ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

The (general) icosahedron is a 20-faced polyhedron (where icos- derives from the Greek word for "twenty" and -hedron comes from the Indo-European word for "seat"). Examples ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

Attractive compounds of four octahedra can be constructed as the duals of the cube 4-compounds. These compounds will be implemented in a future version of the Wolfram ...

A pentagonal pyramid is pyramid having a pentagonal base. The edge length e and slant height s of a pentagonal pyramid with regular base of side length a are given by e = ...

The pentagrammic crossed antiprism is the uniform polyhedron with Maeder index 80 (Maeder 1997), Coxeter index 35 (Coxeter et al. 1954), and Har'El index 5 (Har'El 1993). It ...

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...