TY - JOUR ID - 930 TI - Connections between labellings of trees JO - Bulletin of the Iranian Mathematical Society JA - BIMS LA - en SN - 1017-060X AU - Yao, B. AU - Liu, X. AU - Yao, M. AD - College of Mathematics and Statistics‎, ‎Northwest‎ ‎Normal University‎, ‎Lanzhou‎, ‎730070‎, ‎China. AD - School of Mathematics and Statistics‎, ‎Beijing Institute of Techology‎, ‎Beijing 100081‎, ‎China. AD - Department of Information Process and Control Engineering‎, ‎Lanzhou Petrochemical College of Vocational Technology‎, ‎Lanzhou‎, ‎730060‎, ‎China. Y1 - 2017 PY - 2017 VL - 43 IS - 2 SP - 275 EP - 283 KW - trees KW - (odd-)graceful labellings KW - felicitous lalbellings KW - (k KW - d)-graceful labellings DO - N2 - There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs. UR - http://bims.iranjournals.ir/article_930.html L1 - http://bims.iranjournals.ir/article_930_493991d8c291f08d8bd8ff563e3af03f.pdf ER -