Search Results for ""

The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

The trigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating three of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn ...

A map f from a metric space M=(M,d) to a metric space N=(N,rho) is said to be uniformly continuous if for every epsilon>0, there exists a delta>0 such that ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The Kirchhoff sum index KfS is a graph index defined for a graph on n nodes by KfS=1/2sum_(i=1)^nsum_(j=1)^n((Omega)_(ij))/((d)_(ij)), where (Omega)_(ij) is the resistance ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...