期刊文献+

On Balance Index Set for the General Butterfly Graph 被引量:1

On Balance Index Set for the General Butterfly Graph
下载PDF
导出
摘要 In this paper, we introduce the concept of the general butterfly graph B[m,n;d] for integers m,n ≥ 3, d ≥ 1, determine its balance index set, and give the necessary and sufficient condition for balanced graph B[m,n;d] to exist. In this paper, we introduce the concept of the general butterfly graph B[m, n; d] for integers m,n ≥ 3, d ≥ 1, determine its balance index set, and give the necessary and sufficient condition for balanced graph B[m, n; d] to exist.
出处 《Journal of Mathematical Research and Exposition》 CSCD 2009年第2期202-212,共11页 数学研究与评论(英文版)
基金 the National Natural Science Foundation of China (No. 10671005) the Natural Science Foundation of Hebei Province (No. A2007000230).
关键词 friendly labeling balance labeling balance index set. 广义蝶图 平衡指标集 数学分析 友好指标
  • 相关文献

参考文献9

  • 1LEE S M, LIU A C, TAN S K. On balanced graphs [J]. Congr. Numer., 1992, 87: 59-64.
  • 2SEOUD M A, ABDEL MAQSOUN A E I. On cordial and balanced labelings of graphs [J]. J. Egyptian Math. Soc., 1999, 7(1): 127-135.
  • 3HOVEY M. A-cordial graphs [J]. Discrete Math., 1991, 93(2-3): 183-194.
  • 4CAHIT I. On cordial and 3-equitable labellings of graphs [J]. Utilitas Math., 1990, 37: 189-197.
  • 5SEAH E. On the construction of cordial graphs [J]. Ars Combin., 1991, 31: 249-254.
  • 6CAIRNIE N, EDWARDS K. The computational complexity of cordial and equitable labelings [J]. Discrete Math., 2000, 216: 29-34.
  • 7SHEE S C, HO Y S. The cordiality of one-point union of n copies of a graph [J]. Discrete Math., 1993, 117(1-3): 225-243.
  • 8SHEE S C, HO Y S. The cordiality of the path-union of n copies of a graph [J]. Discrete Math., 1996, 151(1-3): 221-229.
  • 9KUO S, CHANG G J, KWONG Y H H. Cordial labeling of mKn [J]. Discrete Math., 1997, 169: 1-3.

同被引文献1

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部