halin graphs
Recently Published Documents


TOTAL DOCUMENTS

77
(FIVE YEARS 7)

H-INDEX

9
(FIVE YEARS 0)



Author(s):  
Xiaoli Jiang ◽  
Zhengke Miao ◽  
Xiaowei Yu

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.



2021 ◽  
Vol 302 ◽  
pp. 92-102
Author(s):  
Wei Yang ◽  
Baoyindureng Wu


2021 ◽  
Vol 9 (1) ◽  
pp. 11
Author(s):  
Yu-Chang Liang ◽  
Tsai-Lien Wong ◽  
Xuding Zhu
Keyword(s):  


2021 ◽  
Vol 393 ◽  
pp. 125751
Author(s):  
Xiao Wang ◽  
You Lu ◽  
Shenggui Zhang
Keyword(s):  


Author(s):  
Jinlian Zhang ◽  
Xuhui Peng ◽  
Qiyao Chen
Keyword(s):  


Author(s):  
Steven Chaplick ◽  
Giordano Da Lozzo ◽  
Emilio Di Giacomo ◽  
Giuseppe Liotta ◽  
Fabrizio Montecchiani
Keyword(s):  


2020 ◽  
Vol 142 ◽  
pp. 62-76
Author(s):  
Alejandro Flores-Lamas ◽  
José Alberto Fernández-Zepeda ◽  
Joel Antonio Trejo-Sánchez




Author(s):  
Xin Jin ◽  
Min Chen ◽  
Xinhong Pang ◽  
Jingjing Huo
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document