首页 | 本学科首页   官方微博 | 高级检索  
     

一类含有奇数个顶点的三色有向图本原指数上界
引用本文:罗美金,侯宗毅,李茜. 一类含有奇数个顶点的三色有向图本原指数上界[J]. 数学的实践与认识, 2017, 0(4): 209-216
作者姓名:罗美金  侯宗毅  李茜
作者单位:1. 河池学院数学与统计学院,广西宜州,546300;2. 山西运城农业职业技术学院基础部,山西运城,044000
基金项目:国家自然科学基金(11161018),广西自然科学基金(2013GXNSFBA019022),广西高校科研项目(YB2014335;KY2015ZD103),山西省高等学校科技创新项目(2015113)
摘    要:一个三色有向图D是本原的,当且仅当存在非负整数h、k和v,且h+k+v0,使得D中的每一对顶点(i,j)都存在从i到j的(h,k,v)-途径,h+k+v的最小值定义为三色有向图D的本原指数.研究了一类三色有向图,它的未着色图中包含2佗-4个顶点,一个n-圈、一个(n-2)-圈和一个2-圈,给出了本原指数上界.

关 键 词:三色  有向图  本原  指数  上界

Upper Bound of Primitive Exponent of a Class of ThreeColored Digraphs with Odd Vertices
LUO Mei-jin,HOU Zong-yi,LI Xi. Upper Bound of Primitive Exponent of a Class of ThreeColored Digraphs with Odd Vertices[J]. Mathematics in Practice and Theory, 2017, 0(4): 209-216
Authors:LUO Mei-jin  HOU Zong-yi  LI Xi
Abstract:A three-colored digraph D is primitive if and only if three exists nonnegative integers h,k and v with h + k + v > 0 such that for each pair (i,j) of vertices there exists a (h,k,v)-walk in D from i to j.The exponent of the primitive three-colored digraph D is the minimum value of h + k + v taken over all such h,k and v.A class of three-colored digraphs were studied whose uncolored digraph has 2n-4 vertices,consists of one n-cycle,one (n-2)-cycle and one 2-cycle.The tight upper bound on the primitive exponent were given.
Keywords:three-colored  digraph  primitive  exponent  upper bound
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号