期刊文献+

轮和扇三类联图的邻点被扩展和可区别全染色 被引量:4

The neighbor expanded sum distinguishing total colorings of three types of join graphs of wheel and fan
下载PDF
导出
摘要 探讨了轮与轮的联图的邻点被扩展和可区别全染色,并得到了它的邻点被扩展和可区别全色数,然后通过删边的方法分别得到了扇与轮的联图,扇与扇的联图的邻点被扩展和可区别全染色及它们的邻点被扩展和可区别全色数。 The neighbor expanded sum distinguishing total coloring of join of two wheels is discussed and its neighbor expanded sum distinguishing total coloring index is determined. Then the neighbor expanded sum distinguishing total colorings and neighbor expanded sum distinguishing total coloring indexes of joins of one fan and one wheel, and two fans are obtained, respectively by the method of deleting edges.
作者 张辉 陈祥恩 王治文 ZHANG Hui;CHEN Xiang en;WANG Zhiwen(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China;College of Mathematics and Statistics, Ningxia University, Yinchuan 750021,China)
出处 《中山大学学报(自然科学版)》 CAS CSCD 北大核心 2019年第3期86-93,共8页 Acta Scientiarum Naturalium Universitatis Sunyatseni
基金 国家自然科学基金(11761064,61163037,11261046) 宁夏自然科学基金(2018AAC03055) 宁夏回族自治区百人计划
关键词 联图 邻点被扩展和可区别全染色 邻点被扩展和可区别全色数 the join of graphs the neighbor expanded sum distinguishing total coloring the neighbor expanded sum distinguishing total coloring index
  • 相关文献

参考文献5

二级参考文献28

  • 1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:173
  • 2林泓,林晓霞.若干四角系统完美匹配数的计算[J].福州大学学报(自然科学版),2005,33(6):704-710. 被引量:28
  • 3ZHANG H P, ZHANG F J. Perfect matchings of polyomi- no graphs [J]. Graphs and Combinatorics, 1997, 13 (3) : 259 -304.
  • 4KR/L D, SERENI J S, STIEBITZ M. A new lower bound on the number of perfect matchings in cubic graphs [J]. Siam Journal on Discrete Math, 2009, 23(3) :1465 - 1483.
  • 5KARDOS F, K1LL D, MISKUF J, et al. Fullerene graphs have exponentially many perfect matchings [ J ]. Journal of Mathematical Chemistry', 2008, 46 (2) : 443 - 447.
  • 6ZHANG H P. The connectivity of Z-transformation graphs of perfect matchings of polyominoes [ J]. Discrete Mathe- matics, 1996, 158(1/2/3):257-272.
  • 7LOVSZ L, PLUMMER M. Matching theory [ M ]. New York: North-Holland Press, 1986.
  • 8YAN W G, ZHANG F J. Enumeration of perfect match- ings of a type of Cartesian products of graphs [ J ]. Dis- crete Applied Mathematics, 2006, 154( 1 ) : 145 -157.
  • 9魏丽侠,张昆龙.几类并图的优美标号[J].中山大学学报(自然科学版),2008,47(3):10-13. 被引量:28
  • 10张莲珠.渺位四角系统完美匹配数的计算[J].厦门大学学报(自然科学版),1998,37(5):629-633. 被引量:20

共引文献51

同被引文献40

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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