- 作者: 葉光清; 王鵬程
- 作者服務機構: 逢甲大學應用數學系
- 中文摘要: 給定一含零之非負整數集合T,則我們可定義一圖形G=(V,E)之T-著色f,f為定義在v上之正整數函數,使得當{x,Y}為G之一邊時,(方程式無法摘錄)。T-著色f之徑距(T-span)為f之最大顏色與最小顏色之差,而圖形G之徑距為G之最小T-著色徑距,我們用(方程式無法摘錄)來代表此值。已知(方程式無法摘錄)。我們有興趣的是,那些T-集合會使得對任意圖形G,等式(方程式無法摘錄)均成立。滿足此等式之集合已有若干,本文則提出亦滿足上述等式的一個新的T-集合。
- 英文摘要: Given a finite set T of nonnegative integers, a T-coloring of a simple graph G is a nonnegativeinteger function f defined on the vertex set of G such that if {u, ν} E(G), then∣(方程式無法摘錄). TheT-span of a T-coloring is defined as the difference between the largest and smallest colors used; the T-span of G, is the minimum span over all T-colorings of G. It is known that the T-span of G satisfies(方程式無法摘錄). One interesting problem is for what kinds of T-set T does the equality(方程式無法摘錄) hold for all graphs G. Different kinds of Ts have been found. In this note, we presentanother T-set with the same result.
- 中文關鍵字: Τ-coloring; graph coloring
- 英文關鍵字: --