Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete mathematics, algorithms, and applications
Paper Title
Journal
Date
