A note on 1-2-3 conjecture for Halin graphs
Discrete Mathematics, Algorithms and Applications（2021）
摘要
The well-known 1-2-3 Conjecture asserts the edges of every connected graph with at least three vertices can be weighted with 1, 2 and 3 so that adjacent vertices receive distinct sums of weights. In this paper, we show this conjecture holds for Halin graph. Moreover, this bound is tight.
更多查看译文
关键词
1-2-3 Conjecture, edge-weighting, vertex-coloring, Halin graph
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要