首页 | 本学科首页   官方微博 | 高级检索  
     


A sum labelling for the generalised friendship graph
Authors:Henning Fernau  Joe F. Ryan  Kiki A. Sugeng
Affiliation:1. FB 4—Abt. Informatik, Universität Trier, D-54286 Trier, Germany;2. School of Information Technology and Mathematical Sciences, University of Ballarat, Vic. 3350, Australia;1. UK;2. UK;3. UK;4. UK;5. UK;6. UK
Abstract:We provide an optimal sum labelling scheme for the generalised friendship graph, also known as the flower (a symmetric collection of cycles meeting at a common vertex) and show that its sum number is 2.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号