具有两个度数的树(英文)_乔璞.pdf
《具有两个度数的树(英文)_乔璞.pdf》由会员分享,可在线阅读,更多相关《具有两个度数的树(英文)_乔璞.pdf(4页珍藏版)》请在咨信网上搜索。
1、Article ID:1000-5641(2023)02-0001-04Two-degree treesQIAO Pu1,ZHAN Xingzhi2(1.School of Mathematics,East China University of Science and Technology,Shanghai200237,China;2.School of Mathematical Sciences,East China Normal University,Shanghai200241,China)1dd 2;(1,d)n,d(1,d)n;d(1,d)nn.Abstract:A graph i
2、s called a two-degree graph if its vertices have only two distinct degrees.A two-degreetree of order at least three have two degrees,and for some such a tree is called a -tree.Given a positive integer we determine:(1)the possible values of such that there exists a -tree oforder (2)the values of such
3、 that there exists a unique -tree of order ,and(3)the maximumdiameter of two-degree trees of order The results provide a new example showing that the behavior ofgraphs may sometimes be determined by number theoretic properties.Keywords:two-degree tree;diameter;unique graphCLC number:O157.5Document c
4、ode:ADOI:10.3969/j.issn.1000-5641.2023.02.001具有两个度数的树乔璞1,詹兴致2(1.华东理工大学 数学学院,上海200237;2.华东师范大学 数学科学学院,上海200241)dd(1,d)nn(1,d)dn(1,d)dn(1,d)摘要:如果一个图只有两个不同的度数,这个图就称为二度图.阶数至少为 3 的二度树具有度数 1 和 ,这里 是至少为 2 的整数,这样的树称为 -树.给定一个正整数 ,确定了以下信息:(1)存在一个 阶-树的可能的 的值;(2)存在唯一的 阶 -树的可能的 的值;(3)阶 -树的最大可能直径.这些结果提供了一个新的例子,表明
5、有时候图的行为是由数论性质决定的.关键词:二度树;直径;唯一图 1dd 2;(1,d)(1,3)1(1,d)ddThe order of a graph is its number of vertices,and the size of a graph is its number of edges.Atree is a connected graph that contains no cycles.Trees are the simplest connected graphs in the sensethat they have the least possible size among co
6、nnected graphs of a given order.A graph is called atwo-degree graph if its vertices have only two distinct degrees.A leaf of a graph is a vertex of degree1.Every nontrivial tree has at least two leaves1.Thus,a two-degree tree has two degrees,and for some such a tree is called a -tree.-trees are call
7、ed cubic trees2.One might thinkthat we can omit“”and simply refer to a -tree as a -tree.However,this cannot be done,because the term -tree already has another well established meaning3.nd(1,d)For a given positive integer ,what are the possible values of such that there exists a -收稿日期:2021-05-07基金项目:
8、国家自然科学基金(11671148,11771148);上海市科学技术委员会基金(18dz2271000)第一作者:乔璞,女,讲师,博士,研究方向为图论.E-mail:通信作者:詹兴致,男,教授,研究方向为图论、矩阵论.E-mail: 第 2 期华东师范大学学报(自然科学版)No.22023 年 3 月Journal of East China Normal University(Natural Science)Mar.2023n(1,d)20d=2,3,4,7,10,19,(1,d)39d=238d20,d39.tree of order?Let us consider two exampl
9、es:(1)There exists a -tree of order if and only if or and(2)there exists a -tree of order if and only if or .Thus,there are six possible values of for the order but there are only two possible values of for thelarger order Why?nd(1,d)nd(1,d)nnIn this paper,for a given positive integer ,we determine(
10、1)the possible values of such thatthere exists a -tree of order ;(2)the values of such that there exists a unique -tree oforder ;and(3)the maximum diameter of two-degree trees of order .These results provide a newexample showing that the behavior of graphs may sometimes be determined by number theor
11、eticproperties.A caterpillar is a tree in which a single path(the spine)is incident to or contains every edge;inother words,removal of its leaves yields a path.dnd 1n 2CP(n,d)n(1,d)Notation 1 Let and be positive integers such that divides .We use todenote the unique caterpillar of order which is a -
12、tree.CP(18,5)The caterpillar is depicted in Figure 1.Fig.1 The caterpillar CP(18,5)n 3(1,d)nd 1n 2Theorem 1 Let be a positive integer.Then,there exists a -tree of order if and onlyif divides .(1,d)nVeProof Suppose there exists a -tree of order .The degree sum formula1 proved byLeonhard Euler in 1736
13、 states that if a graph has vertex set and size ,thenxVdeg(x)=2e,deg(x)x(1,d)nkdn k1nn 1(n k)+kd=2(n 1)(d 1)k=n 2d 1n 2where denotes the degree of the vertex .Now suppose in a -tree of order ,there are vertices of degree and,hence,there are vertices of degree .Since a tree of order has size,by the d
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 具有 两个 度数 英文 乔璞
1、咨信平台为文档C2C交易模式,即用户上传的文档直接被用户下载,收益归上传人(含作者)所有;本站仅是提供信息存储空间和展示预览,仅对用户上传内容的表现方式做保护处理,对上载内容不做任何修改或编辑。所展示的作品文档包括内容和图片全部来源于网络用户和作者上传投稿,我们不确定上传用户享有完全著作权,根据《信息网络传播权保护条例》,如果侵犯了您的版权、权益或隐私,请联系我们,核实后会尽快下架及时删除,并可随时和客服了解处理情况,尊重保护知识产权我们共同努力。
2、文档的总页数、文档格式和文档大小以系统显示为准(内容中显示的页数不一定正确),网站客服只以系统显示的页数、文件格式、文档大小作为仲裁依据,平台无法对文档的真实性、完整性、权威性、准确性、专业性及其观点立场做任何保证或承诺,下载前须认真查看,确认无误后再购买,务必慎重购买;若有违法违纪将进行移交司法处理,若涉侵权平台将进行基本处罚并下架。
3、本站所有内容均由用户上传,付费前请自行鉴别,如您付费,意味着您已接受本站规则且自行承担风险,本站不进行额外附加服务,虚拟产品一经售出概不退款(未进行购买下载可退充值款),文档一经付费(服务费)、不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
4、如你看到网页展示的文档有www.zixin.com.cn水印,是因预览和防盗链等技术需要对页面进行转换压缩成图而已,我们并不对上传的文档进行任何编辑或修改,文档下载后都不会有水印标识(原文档上传前个别存留的除外),下载后原文更清晰;试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓;PPT和DOC文档可被视为“模板”,允许上传人保留章节、目录结构的情况下删减部份的内容;PDF文档不管是原文档转换或图片扫描而得,本站不作要求视为允许,下载前自行私信或留言给上传者【自信****多点】。
5、本文档所展示的图片、画像、字体、音乐的版权可能需版权方额外授权,请谨慎使用;网站提供的党政主题相关内容(国旗、国徽、党徽--等)目的在于配合国家政策宣传,仅限个人学习分享使用,禁止用于任何广告和商用目的。
6、文档遇到问题,请及时私信或留言给本站上传会员【自信****多点】,需本站解决可联系【 微信客服】、【 QQ客服】,若有其他问题请点击或扫码反馈【 服务填表】;文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“【 版权申诉】”(推荐),意见反馈和侵权处理邮箱:1219186828@qq.com;也可以拔打客服电话:4008-655-100;投诉/维权电话:4009-655-100。