期刊文献+

似星树与路的乘积图的任意可分性 被引量:1

Arbitrarily Partitionable Product Graph ofStar-Like Tree and Path
下载PDF
导出
摘要 设似星树S=S(a 1,a 2,…,a t,b 1,b 2,…,b s),其中a i(1≤i≤t)是奇数,bj(1≤j≤s)是偶数.首先,讨论似星树S与路Pl的乘积图S■P l在t和s不同取值下是否为任意可分图,并用图不含完美匹配的方法和反证法给出其不是任意可分图的充分条件;其次,分析图S■P l的Hamilton性,并用似星树的任意可分性给出图为任意可分图的充分条件.结果表明,当t=1且s≤2时,图S■P l是任意可分图;当t≥2或t=0,或者t=1,s≥3,b 1=b 2=…=b s,t+s≥l+2时,图S■P l均不是任意可分图. Let S=S(a 1,a 2,…,a t,b 1,b 2,…,b s)be a star-like tree,where a i is odd,b j is even for 1≤i≤t,1≤j≤s.Firstly,under different values of t and s,we discuss whether the product graph S■P l of a star-like tree S and a path P l is arbi trarily partitionable graph.We give some sufficient conditions for S such that S■P l is not arbitrarily partitionable graph by contradicti on and the method of graphs without perfect matching.Secondly,by analyzing the Hamiltonian property of graphs S■P l and using arbitrary partition of s tar-like trees,we give some sufficient conditions for S such that S■P l is arbitrarily partitionable graph.The results show that if t=1 and s≤2,then S P l is arbitrarily partitionable graph;if t≥2 or t=0,or t=1,s≥3,b 1=b 2=…=b s,t+s≥l+2,then S■P l is not arbitrarily partitionable graph.
作者 张盼盼 刘凤霞 孟吉翔 ZHANG Panpan;LIU Fengxia;MENG Jixiang(College of Mathematics and System Science,Xinjiang University,Urumqi 830046,China)
出处 《吉林大学学报(理学版)》 CAS 北大核心 2021年第3期525-530,共6页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:11961067)。
关键词 任意可分图 乘积图 似星树 可迹图 arbitrarily partitionable graph product graph star-like tree traceable graph
  • 相关文献

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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