標題: ON PRIME LABELINGS
作者: FU, HL
HUANG, KC
應用數學系
Department of Applied Mathematics
公開日期: 15-三月-1994
摘要: Let G = (V, E) be a graph. A bijection f:V--> {1, 2,...,V} is called a prime labelling if for each e = {u, v} in E, we have GCD(f(u),f(v)) = 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conjecture is true for trees of order up to 15, and also show that a few other classes of graphs are prime.
URI: http://hdl.handle.net/11536/2580
ISSN: 0012-365X
期刊: DISCRETE MATHEMATICS
Volume: 127
Issue: 1-3
起始頁: 181
結束頁: 186
顯示於類別:期刊論文


文件中的檔案:

  1. A1994NG61900017.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。