中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Identifying codes of cycles with odd orders

文献类型:期刊论文

作者Xu, Min1,2; Thulasiraman, Krishnaiyan2; Hu, Xiao-Dong3
刊名EUROPEAN JOURNAL OF COMBINATORICS
出版日期2008-10-01
卷号29期号:7页码:1717-1720
ISSN号0195-6698
DOI10.1016/j.ejc.2007.09.006
英文摘要The problem of the r-identifying code of a cycle C, has been solved totally when n is even. Recently, S. Gravier et al, give the r-identifying code for the cycle C-n with the minimum cardinality for odd it, when n >= 3r + 2 and gcd(2r + 1, n) not equal 1. In this paper, we deal with the r-identifying code of the cycle C-n for odd n, when n >= 3r + 2 and gcd(2r + 1, n) = 1. (c) 2007 Elsevier Ltd. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000257856100019
出版者ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/6958]  
专题应用数学研究所
通讯作者Xu, Min
作者单位1.Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China
2.Univ Oklahoma, Sch Comp Sci, Norman, OK 73019 USA
3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Xu, Min,Thulasiraman, Krishnaiyan,Hu, Xiao-Dong. Identifying codes of cycles with odd orders[J]. EUROPEAN JOURNAL OF COMBINATORICS,2008,29(7):1717-1720.
APA Xu, Min,Thulasiraman, Krishnaiyan,&Hu, Xiao-Dong.(2008).Identifying codes of cycles with odd orders.EUROPEAN JOURNAL OF COMBINATORICS,29(7),1717-1720.
MLA Xu, Min,et al."Identifying codes of cycles with odd orders".EUROPEAN JOURNAL OF COMBINATORICS 29.7(2008):1717-1720.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。