Current position: Home >> Scientific Research >> Paper Publications

超环面图上的约束数

Release Time:2019-03-10  Hits:

Indexed by: Journal Article

Date of Publication: 2009-01-01

Journal: 中国科学技术大学学报

Included Journals: CSCD、ISTIC、PKU

Volume: 39

Issue: 3

Page Number: 225-228

ISSN: 0253-2778

Key Words: 约束数;控制数;交叉数;平面图

Abstract: 非空图G的约束数b(G)是指使得图G的控制数γ(G)增大而删除的最少的边数.[Fischermann M, Rautenbach D, Volkmann L. Remarks on the bondage number of planar graphs. Discrete Math,2003,260:57-67\]已经证明,对于一个围长为g(G)的平面图G,如果g(G)≥4则b(G)≤6,如果g(G)≥5则b(G)≤5,如果g(G)≥6则b(G)≤4,如果g(G)≥8则b(G)≤3.我们把这个结果推广到连通的超环面图中.

Prev One:The Graphs C(13)(t) are Graceful for t equivalent to 0, 3 (mod 4)

Next One:On the gracefulness of the digraphs n - C m