Andere Kunden interessierten sich auch für
![Odd Greedy Expansion]( "Odd Greedy Expansion")
Odd Greedy Expansion25,99 €![Odd Magnus Faltinsen]( "Odd Magnus Faltinsen")
Odd Magnus Faltinsen35,99 €![Odd Number Theorem]( "Odd Number Theorem")
Odd Number Theorem25,99 €![Wike's Law of Low Odd Primes]( "Wike's Law of Low Odd Primes")
Wike's Law of Low Odd Primes25,99 €![On Artin Cokernel of The Group Q2m×D3 when m is an Odd Number]( "On Artin Cokernel of The Group Q2m×D3 when m is an Odd Number")
On Artin Cokernel of The Group Q2m×D3 when m is an Odd Number39,99 €![Even and odd functions]( "Even and odd functions")
Even and odd functions22,99 €![Odd Order Group Actions and Witt Classification of Innerproducts]( "Odd Order Group Actions and Witt Classification of Innerproducts")
Odd Order Group Actions and Witt Classification of Innerproducts28,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the mathematical field of graph theory, the odd graph On is the graph whose vertex set contains all n 1-element subsets of X = {1,2,...2n 1} and in which an edge connects two vertices iff the corresponding subsets are disjoint. It has tbinom {2n-1}{n-1} vertices and ntbinom {2n-1}{n-1}/2 edges. Therefore, the number of vertices for n = 1, 2,... is 1, 3, 10, 35, 126, 462, 1716, 6435 (sequence A001700 in OEIS). An odd graph is regular of degree n, and it is also distance transitive, hence distance regular. The most familiar example of an odd graph is the Petersen graph, which is O3, while O2 is the triangle.