您的位置: 专家智库 > >

吴建专

作品数:7 被引量:2H指数:1
供职机构:东南大学更多>>
发文基金:国家自然科学基金更多>>
相关领域:理学更多>>

文献类型

  • 6篇期刊文章
  • 1篇学位论文

领域

  • 7篇理学

主题

  • 2篇点色数
  • 2篇色数
  • 2篇SOME
  • 2篇STAR
  • 1篇英文
  • 1篇图论
  • 1篇强边着色
  • 1篇连通性
  • 1篇邻集
  • 1篇邻集并
  • 1篇距离图
  • 1篇泛连通性
  • 1篇边着色
  • 1篇RESULT...
  • 1篇AR
  • 1篇CIRCUL...
  • 1篇CLASS
  • 1篇EXTREM...
  • 1篇标号
  • 1篇标号问题

机构

  • 7篇东南大学
  • 2篇南京化工大学

作者

  • 7篇吴建专
  • 2篇宋增民
  • 2篇林文松
  • 2篇殷翔
  • 1篇许克祥

传媒

  • 4篇Journa...
  • 1篇南京化工大学...
  • 1篇南京大学学报...

年份

  • 2篇2008
  • 1篇2006
  • 2篇2002
  • 2篇2001
7 条 记 录,以下是 1-7
排序方式:
The Star-Extremality of Circulant Graphs
2002年
The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is star extremal if its circular chromatic number is equal to its fractional chromatic number. This paper gives an improvement of a theorem. And we show that several classes of circulant graphs are star extremal.
吴建专许克祥
两类距离图的分式色数和点色数被引量:1
2001年
分式色数和点色数是图的两个重要参数。本文在文献 [1]的基础上给出了两类距离图G(Z ,Dm ,k,k + 1)与G(Z ,Dm ,k ,k + 1,k + 2 )的分式色数和点色数。
吴建专殷翔
关键词:距离图点色数
Some results on circular chromatic number of a graph
2008年
For two integers k and d with (k, d) = 1 and k≥2d, let G^dk be the graph with vertex set {0,1,…k - 1 } in which ij is an edge if and only if d≤| i -j I|≤k - d. The circular chromatic number χc(G) of a graph G is the minimum of k/d for which G admits a homomorphism to G^dk. The relationship between χc( G- v) and χc (G)is investigated. In particular, the circular chromatic number of G^dk - v for any vertex v is determined. Some graphs withx χc(G - v) =χc(G) - 1 for any vertex v and with certain properties are presented. Some lower bounds for the circular chromatic number of a graph are studied, and a necessary and sufficient condition under which the circular chromatic number of a graph attains the lower bound χ- 1 + 1/α is proved, where χ is the chromatic number of G and a is its independence number.
吴建专林文松
Circular Chromatic Numbers of Some Distance Graphs
2001年
The circular chromatic number of a graph is an important parameter of a graph. The distance graph G(Z,D) , with a distance set D , is the infinite graph with vertex set Z={0,±1,±2,...} in which two vertices x and y are adjacent iff y-x∈D . This paper determines the circular chromatic numbers of two classes of distance graphs G(Z,D m,k,k+1 ) and G(Z,D m,k,k+1,k+2 ).
殷翔吴建专
距离为2的邻集并条件与图的泛连通性(英文)
2006年
设G是一个顶点数为n(≥5)最小度为δ的2-连通简单图.本文证明了若图G的每一对距离为2的顶点u,v都满足|N(u)∪(v)|≥n-δ+1,则除非G属于某些特殊图类,它的任意一对顶点x,y之间都存在长度从d(x,y)到n-1的路.
吴建专林文松宋增民
关键词:邻集并泛连通性
图的距离二边标号问题
在图的经典的顶点着色(或边着色)中,我们只要求任意两个相邻顶点(或相邻边)所着颜色不相同.如果还要求距离为二的顶点(或距离为二的边)所着颜色也不相同,我们就得到图的距离二着色(或强边着色).图的距离二着色实际上就是原图的...
吴建专
关键词:点色数图论强边着色
文献传递
A Class of Star Extremal Circulant Graphs
2002年
The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph. A graph is called star extremal if its fractional chromatic number equals to its circular chromatic number (also known as the star chromatic number). This paper studies the star extremality of the circulant graphs whose generating sets are of the form {±1,±k} .
吴建专宋增民
共1页<1>
聚类工具0