翻訳と辞書 Words near each other ・ T-cell leukemia ・ T-cell lymphoma ・ T-cell lymphoma invasion and metastasis-inducing protein 1 ・ T-cell prolymphocytic leukemia ・ T-cell receptor excision circles ・ T-cell surface glycoprotein CD3 epsilon chain ・ T-cell vaccination ・ T-cell vaccine ・ T-Center ・ T-Centralen ・ T-class ferry ・ T-class submarine ・ T-closeness ・ T-code ・ T-Coffee ・ T-coloring ・ T-comma ・ T-commerce ・ T-complex 1 ・ T-Connection ・ T-cophony ・ T-criterion ・ T-distributed stochastic neighbor embedding ・ T-Dog ・ T-Dog (The Walking Dead) ・ T-Dre Player ・ T-duality ・ T-Engine Forum ・ T-FLEX CAD ・ T-Force Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク T-coloring ： ウィキペディア英語版 T-coloring In graph theory, a T-Coloring of a graph $G\; =\; (V,\; E)$, given the set ''T'' of nonnegative integers containing 0, is a function $c:\; V(G)\; \backslash rightarrow\; \backslash mathbb$ that maps each vertex of G to a positive integer (color) such that $(u,w)\; \backslash in\; E(G)\; \backslash Rightarrow\; \backslash left\; |\; c(u)\; -\; c(w)\; \backslash right\; |\; \backslash notin\; T$. In simple words, the absolute value of the difference between two colors of adjacent vertices must not belong to fixed set ''T''. The concept was introduced by William K. Hale.〔W. K. Hale, Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514.〕 If ''T = '' it reduces to common vertex coloring. The ''complementary coloring'' of ''T''-coloring ''c'', denoted $\backslash overline$ is defined for each vertex ''v'' of ''G'' by $\backslash overline(v)\; =\; s\; +1-c(v)$ where ''s'' is the largest color assigned to a vertex of ''G'' by the ''c'' function.〔 == ''T''-chromatic number == The ''T-chromatic number'' $\backslash chi\_(G)$ is the minimum number of colors that can be used in a ''T''-coloring of ''G''. The ''T''-chromatic number is equal to the chromatic number. $\backslash chi\_(G)=\backslash chi(G)$.〔M. B. Cozzens and F. S. Roberts, T -colorings of graphs and the Channel Assignment Problem. Congr. Numer. 35 (1982) 191-208.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「T-coloring」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.