On the Clique-Transversal Number in(Claw,K4 )-Free 4-Regular Graphs
被引:0
|
作者:
Ding Guo WANG
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics,Shanghai University
College of Mathematics Science,Chongqing Normal UniversityDepartment of Mathematics,Shanghai University
Ding Guo WANG
[1
,2
]
论文数: 引用数:
h-index:
机构:
Er Fang SHAN
[3
]
Zuo Song LIANG
论文数: 0引用数: 0
h-index: 0
机构:
School of Management,Shanghai UniversityDepartment of Mathematics,Shanghai University
Zuo Song LIANG
[3
]
机构:
[1] Department of Mathematics,Shanghai University
[2] College of Mathematics Science,Chongqing Normal University
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].
机构:
Lomonosov Moscow State University, Moscow
Moscow Center of Fundamental and Applied Mathematics, Moscow
Moscow Institute of Physics and Technology, DolgoprudnyLomonosov Moscow State University, Moscow
Guterman A.E.
Kreines E.M.
论文数: 0引用数: 0
h-index: 0
机构:
Lomonosov Moscow State University, Moscow
Moscow Center of Fundamental and Applied Mathematics, MoscowLomonosov Moscow State University, Moscow
Kreines E.M.
Ostroukhova N.V.
论文数: 0引用数: 0
h-index: 0
机构:
Lomonosov Moscow State University, MoscowLomonosov Moscow State University, Moscow