Search Results for ""

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

Any real function u(x,y) with continuous second partial derivatives which satisfies Laplace's equation, del ^2u(x,y)=0, (1) is called a harmonic function. Harmonic functions ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...