Search Results for ""

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

The conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...

Let z be defined as a function of w in terms of a parameter alpha by z=w+alphaphi(z). (1) Then Lagrange's inversion theorem, also called a Lagrange expansion, states that any ...

A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...

A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...

Let K be a number field and let O be an order in K. Then the set of equivalence classes of invertible fractional ideals of O forms a multiplicative Abelian group called the ...