Search Results for ""

Graph Strength

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

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 ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

An n-dimensional closed disk of radius r is the collection of points of distance <=r from a fixed point in n-dimensional Euclidean space. Krantz (1999, p. 3) uses the symbol ...

A commutative unit ring having only finitely many maximal ideals.

In a plane, consider a sum of N two-dimensional vectors with random orientations. Use phasor notation, and let the phase of each vector be random. Assume N unit steps are ...