“CompleteGraph”的概念、定义、习题解题方法及翻译-数学辞典

单词	CompleteGraph
释义	complete graph The complete graph with $n$ vertices, denoted $K_{n}$ , contains all possible edges; that is, any two vertices are adjacent. The complete graph of $4$ vertices, or $K_{4}$ looks like this: The number of edges in $K_{n}$ is the $n-1$ th triangular number. Every vertex in $K_{n}$ has degree $n-1$ ; therefore $K_{n}$ has an Euler circuit if and only if $n$ is odd. A complete graph always has a Hamiltonian path, and the chromatic number of $K_{n}$ is always $n$ .
随便看	Cauchy principal part integral CauchyProduct Cauchy product CauchyRandomVariable Cauchy random variable Cauchy reals Cauchy reals are Cauchy complete CauchyResidueTheorem Cauchy residue theorem CauchyRiemannEquations Cauchy-Riemann equations CauchyRiemannEquationscomplexCoordinates Cauchy-Riemann equations (complex coordinates) CauchyRiemannEquationspolarCoordinates Cauchy-Riemann equations (polar coordinates) CauchySchwarzInequality Cauchy-Schwarz inequality CauchySequence Cauchy sequence CauchysRootTest CauchysTheorem Cauchy’s root test Cauchy’s theorem CayleyDicksonConstruction Cayley-Dickson construction

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

complete graph