中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
The 3-domination-critical graphs with toughness one

文献类型:期刊论文

作者Chen, YJ; Tian, F; Wei, B
刊名UTILITAS MATHEMATICA
出版日期2002-05-01
卷号61页码:239-253
ISSN号0315-3681
英文摘要A graph G is 3-domination-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. In this paper, we give a sufficient and necessary condition for a connected 3-domination-critical G to have toughness tau(G) = 1.
WOS研究方向Mathematics
语种英语
出版者UTIL MATH PUBL INC
WOS记录号WOS:000175585400017
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/16983]  
专题中国科学院数学与系统科学研究院
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Chen, YJ,Tian, F,Wei, B. The 3-domination-critical graphs with toughness one[J]. UTILITAS MATHEMATICA,2002,61:239-253.
APA Chen, YJ,Tian, F,&Wei, B.(2002).The 3-domination-critical graphs with toughness one.UTILITAS MATHEMATICA,61,239-253.
MLA Chen, YJ,et al."The 3-domination-critical graphs with toughness one".UTILITAS MATHEMATICA 61(2002):239-253.

入库方式: OAI收割

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

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

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