TOPICS
Search

Search Results for ""


451 - 460 of 4141 for Non Line Graphs_ 800Search Results
The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...
An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...
The finite group T is one of the three non-Abelian groups of order 12 (out of a total of fives groups of order 12), the other two being the alternating group A_4 and the ...
A strong Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a strong pseudo-Riemannian metric and positive definite. In a very precise way, the ...
A weak Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a weak pseudo-Riemannian metric and positive definite. In a very precise way, the ...
The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...
The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...
A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...
The number of outward directed graph edges from a given graph vertex in a directed graph.
A graph that is not finite is called infinite.
1 ... 43|44|45|46|47|48|49 ... 415 Previous Next

...