欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
关于Cm·Cn,Cm·Sn和Cm·Kn的邻点可区别全色数
ISSN号:1000-5862
期刊名称:《江西师范大学学报:自然科学版》
时间:0
分类:O157.5[理学—数学;理学—基础数学]
作者机构:[1]兰州交通大学,数学系,甘肃,兰州,730070 浙江师范大学,数学系,浙江,金华,321004 兰州交通大学,数学系,甘肃,兰州,730070
相关基金:国家自然科学基金(No.10771197)资助项目.
作者:
朱恩强[1], 吕新忠[1], 张玉红[1]
关键词:
圈, 星, 完全图, 冠图, 邻点可区别全色数
中文摘要:
一个图的正常全染色如果相邻点的点染色及其关联边染色集合是不同的,则称为图的邻点可区别全染色,其所用到的最少颜色数称为图的邻点可区别全色数.该文得到了冠图圈与圈(星,完全图)的邻点可区别全色数.
同期刊论文项目
图的染色与标号
期刊论文 67
同项目期刊论文
Adjacent verte distinguishing edge-colorings of graphs with smaller maximum average degree
A note on full orientation of a graph
The surviving rate of a graph for the firefighter problem
Planar graphs withou 4-cycles are acyclically 6-choosable
Some results on distance two labelling of outerplanar graphs
Independent sets in direct product of vertex-transitive graphs
Adjacent vertex distinguishing total colorings of $K_4$-minor free graphs
Linear coloring of planar graphs with large girth
Star coloring of sparse graphs
Adjacent vertex distinguishing total colorings of outerplanar graphs
Choosability of toroidal graphs without short cycles
On 3-colorability of planar graphs without adjacent short cycles
k-fold coloring of planar graphs
Some results about modified Zagreb indices
PI indices for some classes of bicyclic graphs
The modified Zagreb indices about disjunction and symmetric difference of graphs
The modified Zagreb indices about join and composition of graphs
Some graphs with extremal PI index
The surviving rate of an infected network
On (d,1)-total numbers of graphs
Injective chromatic number of planar graphs
A sufficient condition for a planar graph to be Class 1
(2,1)-Total labelling of trees with sparse vertices of maximu degree
On the 9 total colorability of planar graphs with maximum degree 8 and without intersecting triangle
(2,1)-Total number of trees with maximum degree three
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
The edge-face coloring of graphs embedded in a surface of characteristic zero
Equitable list coloring of planar graphs without 4- and 6-cycles
Enumeration of uniquely pancyclic digraphs with the least arcs
Two kinds of hook length formulas for complete m-ary trees,
Hao Jianxiu, PI index of some simple pericondensed hexagonal systems,
Hao Jianxiu, The PI index of gated amalgam
L(2,1)-labelling number of 2-outer planar graphs
An upper bound for the adjacent vertex-distinguishing chromatic number of a graph
Some bounds for PI indices,
Adjacent vertex distinguishing total coloring of graphs with lower average degree
Diameters of uniform subset graphs
Acyclic 5-choosability of planar graphs without 4-cycles
On 3-colorable planar graphs without short cycles
Coupled choosability of plane graphs
Note on coloring the square of an outerplanar graph
The linear $2$-arboricity of $K4$-minor-free graphs
The numbers of spanning trees in some graphs
The vertex-arboricity of planar graphs
Improper choosability of graphs of nonnegative characteristic
Edge choosability of planar graphs without 5-cycles with a chord
Normalized matching property of restricted subspace lattices
Nested chain order
Equitable list colorings of planar graphs without short cycles
Vertex-distinguishing total chromatic number of CmVWn
q-weighted log-concavity and q- product theorem on the normality of posets
Two linear transformations preserving log-concavity
Labelling planar graphs without 4-cycles with a condition on distance two
A relaxation of Havel's 3-color problem
Linear coloring of graphs embeddable in a surface of nonnegative characteristic
图Cm∨Wn的点可区别全色数
Sm×Sn,Sm×Fn和Sm×Wn的点可区别全色数
三正则图的Upper减控制数
一些图的生成树数
围长至少为6的平面图的线性染色
2-连通外平面图的邻点可区别全染色
第一类图的一个充分条件
几类图的符号全控制数
2-外平面图的L(2,1)-标号数
期刊信息
《江西师范大学学报:自然科学版》
北大核心期刊(2011版)
主管单位:江西师范大学
主办单位:江西师范大学
主编:
地址:南昌市紫阳大道99号
邮编:330022
邮箱:lk8506184@126.com
电话:0791-88506814
国际标准刊号:ISSN:1000-5862
国内统一刊号:ISSN:36-1092/N
邮发代号:44-56
获奖情况:
2009年中国高等学校自然科学学报研究会颁发“全国...,2009年被评为:第四届华东地区优秀期刊奖”,2008年教育部科技司授予“第2届中国高校优秀科技...,2008年江西省新闻出版局授予“第3届江西省优秀期...,2004年教育部科技司授予“全国高校优秀科技期刊二...
国内外数据库收录:
俄罗斯文摘杂志,美国化学文摘(网络版),美国数学评论(网络版),波兰哥白尼索引,德国数学文摘,美国剑桥科学文摘,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版)
被引量:5205