Search Results for ""

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

A Julia set fractal obtained by iterating the function z_(n+1)=c(z_n-sgn(R[z_n])), where sgn(x) is the sign function and R[z] is the real part of z. The plot above sets ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

A fractal-like structure is produced for x<0 by superposing plots of Carotid-Kundalini functions ck_n of different orders n. the region -1<x<0 is called fractal land by ...

The Cesàro fractal is a fractal also known as the torn square fractal. The base curves and motifs for the two fractals illustrated above are shown below. Starting with a unit ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...

Informally, self-similar objects with parameters N and s are described by a power law such as N=s^d, where d=(lnN)/(lns) is the "dimension" of the scaling law, known as the ...