首页 | 本学科首页   官方微博 | 高级检索  
     检索      

On the Clique-Transversal Number in (Claw,K4)-Free 4-Regular Graphs
作者姓名:Ding Guo WANG  Er Fang SHAN  Zuo Song LIANG
作者单位:[1]Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China [2]College of Mathematics Science, Chongqing Normal University, Chongqing 400047, P. R. China [3]School of Management, Shanghai University, Shanghai 200444, P. R. China
基金项目:Supported by National Nature Science Foundation of China(Grant Nos.11171207 and 10971131)
摘    要:A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G.The clique-transversal number,denoted by τC(G),is the minimum cardinality of a clique-transversal set in G.In this paper,we first present a lower bound on τC(G) and characterize the extremal graphs achieving the lower bound for a connected(claw,K4)-free 4-regular graph G.Furthermore,we show that for any 2-connected(claw,K4)-free 4-regular graph G of order n,its clique-transversal number equals to n/3].

关 键 词:正则图  免费  下界  连接  顶点  集合  基数  极图

On the clique-transversal number in (claw,K 4)-free 4-regular graphs
Ding Guo WANG,Er Fang SHAN,Zuo Song LIANG.On the clique-transversal number in (claw,K 4)-free 4-regular graphs[J].Acta Mathematica Sinica,2014,30(3):505-516.
Authors:Ding Guo Wang  Er Fang Shan  Zuo Song Liang
Institution:1. Department of Mathematics, Shanghai University, Shanghai, 200444, P. R. China
2. College of Mathematics Science, Chongqing Normal University, Chongqing, 400047, P. R. China
3. School of Management, Shanghai University, Shanghai, 200444, P. R. China
Abstract:Graph, clique-transversal set, clique, 4-regular graph, claw-free graph
Keywords:Graph  clique-transversal set  clique  -regular graph  claw-free graph
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号