Search Results for ""

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...

The multiplicad is a simple example of an idea like the ruliad. It consists of a rulial multiway system based on the positive integers in which the rules simply multiply by ...

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...

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

A graphical plot which can be used for solving certain types of equations. According to Steinhaus (1999, p. 301), the Nomogram was invented by the French mathematicians ...

A polyhedral graph having nine vertices. There are 2606 nonisomorphic nonahedral graphs, as first enumerated by Federico (1969; Duijvestijn and Federico 1981). Named ...

Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...