正则图的最大-团横贯数与减最大-团横贯数 |
| |
引用本文: | 汪定国,单而芳.正则图的最大-团横贯数与减最大-团横贯数[J].重庆师范学院学报,2013(6):13-16. |
| |
作者姓名: | 汪定国 单而芳 |
| |
作者单位: | [1]重庆师范大学数学学院,重庆400047 [2]上海大学管理学院,上海200444 |
| |
基金项目: | 重庆师范大学青年基金(No.2011XLQ29);重庆市科委自然科学基金(No.CSTC2011JJA00020) |
| |
摘 要: | 本文首先得到了阶数为n、团数为k的连通k-正则图的最大-团横贯数的上界n/k以及n阶连通无爪3-正则图的最大-团横贯数的下界n/4,并对达到这些界的极值图进行了刻画。然后对阶数为n、团数为ω(G)的任意图G 的减最大-团横贯数给出了一个紧的下界1+ω(G)-n,同时对阶数为n、团数为k的连通k-正则图的减最大-团横贯数呈现了一个上界n/k,并刻画了达到这个上界的极值图。
|
关 键 词: | 正则图 无爪 最大-团横贯数 减最大-团横贯数 |
The Maximum-clique Transversal Number and the Minus Maximum-clique Transversal Number of Regular Graphs |
| |
Institution: | WANG Ding-guo , SHANG Er-fang College of Mathematics Science, Chongqing Normal University, Chongqing 400047; 2. School of Management, Shanghai University, Shanghai 200444, China) |
| |
Abstract: | In this paper, firstly, we establish the upper bound n/k on the maximum-clique transversal number for a k-regular graph G with order n and clique number k, and the lower bound n/4 on the maximum-clique transversal numbe for claw-free cubic with order n, mean-while, we characterize the extremat graphs achieving these bounds. Next, we establish a tight lower bound 1+ω(G)-n on the minus maximum-clique transversal number of an arbitrary graph G with order n and clique number ω (G). Meantime, we give an upper bound n/k on the minus maximum-clique transversal number for a k-regular graph G with order n and clique number k and characterize the extremal graphs achieving the upper bound. |
| |
Keywords: | regular graph claw-free maximum-clique transversal number minus maximum-clique transversal number |
本文献已被 维普 等数据库收录! |
|