删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

极小循环图的圈点连通度

本站小编 Free考研考试/2021-12-27

极小循环图的圈点连通度 陈来焕1, 孟吉翔2, 刘凤霞2, 田应智21. 河南财经政法大学数学与信息科学学院, 郑州 450003;
2. 新疆大学数学与系统科学学院, 乌鲁木齐 830046 Cyclic Vertex Connectivity of Minimal Circulant Graphs CHEN Laihuan1, MENG Jixiang2, LIU Fengxia2, TIAN Yingzhi21. College of Mathematics and Information Sciences, Henan University of Economics and Law, Zhengzhou 450003, China;
2. College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
摘要
图/表
参考文献
相关文章(12)
点击分布统计
下载分布统计
-->

全文: PDF(601 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)
摘要如果X-F中至少两个分支含圈,则称点集F为图X的一个圈点割.图X的所有圈点割的最小基数称为图X的圈点连通度,记为κcX).在本文中,我们证明了极小循环图X=CZnS)在满足:(1)|S|≥2且对于aS有2a≡0(模n)或3a≡0(模n);或(2)|S|≥3且对任意的aS有2a≡0(模n),3a≡0(模n),则κcX)=gk-2),其中gkk>2)分别为图X的围长和正则度.
服务
加入引用管理器
E-mail Alert
RSS
收稿日期: 2015-10-08
PACS:O157.5
基金资助:国家自然科学基金(No.11531011,11501487)资助项目.

引用本文:
陈来焕, 孟吉翔, 刘凤霞, 田应智. 极小循环图的圈点连通度[J]. 应用数学学报, 2019, 42(2): 208-219. CHEN Laihuan, MENG Jixiang, LIU Fengxia, TIAN Yingzhi. Cyclic Vertex Connectivity of Minimal Circulant Graphs. Acta Mathematicae Applicatae Sinica, 2019, 42(2): 208-219.
链接本文:
http://123.57.41.99/jweb_yysxxb/CN/ http://123.57.41.99/jweb_yysxxb/CN/Y2019/V42/I2/208


[1] Bondy J A, Murty U S R. Graph Theory, Graduate Texts in Mathematics 244. Berlin:Springer-Verlag, 2008
[2] Harary F. Conditional connectivity. Networks, 1983, 13:347-357
[3] Birkhoff G D. The reducibility of maps. Am. J. Math., 1913, 35:115-128
[4] Tait P G. Remaks on the coloring of maps. Proc. Roy. Soc., Edinburgh, 1880, 10:501-503
[5] Zhang C Q. Integer flows and cycle covers of graphs. Marcel Dekker Inc:New York, 1997
[6] Holton D A, Lou D, Plummer M D. On the 2-extendability of planner graphs. Discrete Math., 1991, 96:81-99
[7] Lou D, Holton D A. Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discrete Math., 1993, 112:139-150
[8] Yu Z H, Liu Q H, Zhang Z. Cyclic vertex connectivity of star graphs. In:Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications. LNCS, 2010, 6508:212-221
[9] Cheng E, Lipták L, Qiu K, Shen Z. Cyclic vertex-connectivity of Cayley graphs generated by transposition trees. Graphs and Combinatorics, 2013, 29:835-841
[10] Boech F T, Tindell R. Circulants and their connectivity. J. Graph Theory, 1984, 8:487-499
[11] Feng R, Kwak J H. Circulant double coverings of a circulant graph of valency four. Graphs and Combinatorics, 2005, 21:386-400
[12] Feng R Q, Kwak J H. Circulant double coverings of a circulant graph of valency five. Acta Mathematica Sinica, English Series, 2007, 23(1):23-28
[13] Muga F P. Undirected circulant graphs. In:Int. Symp. Parallel Architectures, Algorithms and Networks, 1994, 113-118
[14] Stojmenovic I. Multiplicative circulant networks. Topological properties and communication algorithms. Discrete Appl. Math., 1997, 77:281-305
[15] Wasin S. Integral circulant graphs. Discrete Mathematics, 2005, 306:153-158
[16] Zhang F J, Huang Q X. Infinite circulants and their properties. Acta Mathematica Sinica, English Series, 1995, 11(3):280-284
[17] Mader W. Über den Zusammen Symmetricher Graphen. Arch. Math., 1970, 21:331-336
[18] Tian Y Z, Meng J X. Restricted connectivity for some interconnection networks. Graphs and Combinatorics, 2015, 31(5):1727-1737

[1]李建喜, 郭继明, 邵慰慈. 给定团数的连通图的最小代数连通度[J]. 应用数学学报, 2016, 39(6): 928-937.
[2]刘新求, 黄元秋. 一类循环图在射影平面上的嵌入[J]. 应用数学学报, 2015, 38(3): 385-395.
[3]才仁文毛. 类循环图的可定向嵌入[J]. 应用数学学报, 2015, 38(3): 460-465.
[4]刘爱霞, 原军. 超级限制边连通二部图的充分条件[J]. 应用数学学报(英文版), 2013, 36(2): 209-216.
[5]袁梓瀚, 黄元秋, 刘金旺. 循环图C(9,2)与路Pn的笛卡尔积的交叉数[J]. 应用数学学报(英文版), 2013, 36(2): 350-362.
[6]徐敏, 经衿. Bubble-sort网络的连通度和超连通度[J]. 应用数学学报(英文版), 2012, 35(5): 789-794.
[7]管宇, 张晓东, 徐光辉. 树的变形与代数连通度[J]. 应用数学学报(英文版), 2011, 34(2): 341-352.
[8]管宇, 张晓东, 徐光辉. 树的变形与代数连通度[J]. 应用数学学报(英文版), 2011, 34(1): 341-352.
[9]陈海燕. 几类循环图上随机游动的平均击中时间[J]. 应用数学学报(英文版), 2008, 31(6): 1106-1117.
[10]吕长虹, 张克民. 无向de-Bruijn图的超级边连通性和限制性边连通度[J]. 应用数学学报(英文版), 2002, 25(1): 29-35.
[11]郑忠国, 孙丽丽. 带有反馈的因果模型中的独立性识别[J]. 应用数学学报(英文版), 2000, 23(2): 299-310.
[12]孙铮, 刘桂真. (mg,mf)-图中具有特殊性质的(g,f)-因子[J]. 应用数学学报(英文版), 1999, 22(2): 292-298.



PDF全文下载地址:

http://123.57.41.99/jweb_yysxxb/CN/article/downloadArticleFile.do?attachType=PDF&id=14603
相关话题/应用数学 代数 统计 河南财经政法大学 数学与信息科学学院