Search Results for ""

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

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...

A formula which transforms a given coordinate system by rotating it through a counterclockwise angle Phi about an axis n^^. Referring to the above figure (Goldstein 1980), ...

The set of fixed points which do not move as a knot is transformed into itself is not a knot. The conjecture was proved in 1978 (Morgan and Bass 1984). According to Morgan ...

The concept of a space is an extremely general and important mathematical construct. Members of the space obey certain addition properties. Spaces which have been ...

A short exact sequence of groups 0-->A-->B-->C-->0 (1) is called split if it essentially presents B as the direct sum of the groups A and C. More precisely, one can construct ...

A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...

The Suzuki graph is an edge-transitive strongly regular graph on 1782 vertices with parameters (nu,k,lambda,mu)=(1782,416,100,96) and automorphism group Suz.2. It is an ...