一种证明（k,d）-强优美树的新方法

DOI10.3969/J.ISSN.1000-5641.2016.04.008zbMath1374.05202OpenAlexW2605160643MaRDI QIDQ2984068

Xiyang Zhao, Bing Yao, Xiao-Min Wang

Publication date: 17 May 2017

Full work available at URL: https://xblk.ecnu.edu.cn/CN/10.3969/j.issn.1000-5641.2016.04.008

zbMATH Keywords

perfect matchingstrongly \((k, d)\)-graceful labellingstrongly odd-graceful labelling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: 一种证明（k,d）-强优美树的新方法